Submission #2096875

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

using namespace std;

string direction(int angle) {
  if (angle <= 112 || angle > 3487) {
    return "N";
  }

  const vector<tuple<int, string>> dict = {
    make_tuple( 337, "NNE"),
    make_tuple( 562, "NE"),
    make_tuple( 787, "ENE"),
    make_tuple(1012, "E"),
    make_tuple(1237, "ESE"),
    make_tuple(1462, "SE"),
    make_tuple(1687, "SSE"),
    make_tuple(1912, "S"),
    make_tuple(2137, "SSW"),
    make_tuple(2362, "SW"),
    make_tuple(2587, "WSW"),
    make_tuple(2812, "W"),
    make_tuple(3037, "WNW"),
    make_tuple(3262, "NW"),
    make_tuple(3487, "NNW"),
  };
  for (auto &&entry : dict) {
    int max; string d;
    std::tie(max, d) = entry;
    if (angle <= max) {
      return d;
    }
  }
}

int level(int speed) {
  int s = (speed + 3) / 6;
  const vector<int> dict = {
      2,  15,  33,  54,
     79, 107, 138, 171,
    207, 244, 284, 326,
  };
  for (int i = 0; i < 12; ++i) {
    if (s <= dict[i]) {
      return i;
    }
  }
  return 12;
}

int main() {
  int DEG, DIS;
  cin >> DEG >> DIS;
  const auto l = level(DIS);
  if (l == 0) {
    cout << "C 0" << endl;
  } else {
    cout << direction(DEG) << " " << l << endl;
  }
  return 0;
}

Submission Info

Judge Result