Submission #687962

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<i_i, int> p_i;

int main() {
  int deg, dis;
  cin >> deg >> dis;

  vector<string> dir_arr = {"N", "NNE", "NE", "ENE", "E", "ESE", "SE", "SSE", "S", "SSW", "SW", "WSW", "W", "WNW", "NW", "NNW", "N"};

  vector<int> dis_sep = {0, 15, 93, 201, 327, 477, 645, 831, 1029, 1245, 1467, 1707, 1959};
  
  int w = distance(dis_sep.begin(), upper_bound(dis_sep.begin(), dis_sep.end(), dis)); 
  w -= 1;
  string dir;
  if (w == 0) {
    dir = "C";
    cout << dir << " " << w << "\n";
    return 0;
  }

  deg *= 10;
  deg += 1125;
  dir = dir_arr[deg / 2250];
  cout << dir << " " << w << "\n";

  return 0;
}

Submission Info

Judge Result