Submission #131575

---

Source Code Expand

#include <cmath>

#include <iostream>
#include <algorithm>
#include <string>
#include <sstream>
using namespace std;

const double EPS = 1e-8;

double LB[] = { 11.25, 33.75, 56.25, 78.75, 101.25, 123.75, 146.25,
              168.75, 191.25, 213.75, 236.25, 258.75, 281.25, 303.75, 326.25 };
string DIRSTR[] = { "NNE", "NE", "ENE", "E", "ESE", "SE", "SSE", "S", "SSW", "SW", "WSW", "W", "WNW", "NW", "NNW" };
double LB2[] = { 0.2, 1.5, 3.3, 5.4, 7.9, 10.7, 13.8, 17.1, 20.7, 24.4, 28.4, 32.6 };

bool is_ge(double a, double b) {
  return a > b - EPS;
}

bool is_le(double a, double b) {
  return a < b + EPS;
}

bool is_lt(double a, double b) {
  return a < b - EPS;
}

template<class T, class U>
T lexical_cast(const U& from) {
  T to;
  stringstream ss;
  ss << from; ss >> to;
  return to;
}

#define DEBUG(x) cerr << #x << " = " << x << endl

int main() {
  int DIR, W; cin >> DIR >> W;
  string dirOut;
  string wOut;
  double DIR2 = 1.0 * DIR / 10;
  double W2 = floor((1.0 * W / 60 + 0.05 + EPS)*10)/10;
  if(is_ge(W2, 32.7)) {
    wOut = "12";
  }
  else {
    for(int i = 11; i >= 0; i--) {
      if(is_le(W2, LB2[i])) wOut = lexical_cast<string>(i);
    }
  }

  if(wOut == "0") {
    dirOut = "C";
  }
  else if(is_ge(DIR2, 348.75) || is_lt(DIR2, 11.25)) {
    dirOut = "N";
  }
  else {
    for(int i = 0; i < 15; i++) {
      if(is_ge(DIR2, LB[i])) {
        dirOut = DIRSTR[i];
      }
    }
  }
  cout << dirOut << ' ' << wOut << endl;
}

Submission Info

Judge Result