Submission #633273

---

Source Code Expand

#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <sstream>
#include <functional>
#include <set>
using namespace std;

#define rep(i,n) for(int i=0;i<(int)n;i++)
#define repp(i,k,n) for(int i=k;i<(int)n;i++)
#define rei(n) for(int i=0;i<(int)n;i++)
#define rel(n) for(int l=0;l<(int)n;l++)
#define all(s) s.begin(),s.end()
#define INT_MAX 2147483647
#define debug(x) cout<<#x<<": "<<x<<endl;
#define PI 2*acos(0,0)
#define inin(x) int x; cin>>x;
#define ll long long

typedef pair<long long, long long> pii;
typedef pair<int, pii> pipii;

int main()
{
	vector<double> deg(1, 0.0);
	vector<string> deg_s = { "N","NNE","NE","ENE","E","ESE","SE","SSE","S","SSW","SW","WSW","W","WNW","NW","NNW","N" };
	vector<double> dis = { 0.0,0.3,1.6,3.4,5.5,8.0,10.8,13.9,17.2,20.8,24.5,28.5,32.7 };
	for (int i = 1; i <= 16; i++)
	{
		deg.push_back(112.5*(2 * i - 1));
	}
	double d, w;
	int tmp;
	cin >> d >> w;
	w /= 60;  w *= 10; w += 0.5; tmp = w; w = tmp; w /= 10;
	vector<double>::iterator deg_i, dis_i;
	deg_i = upper_bound(all(deg), d);
	dis_i = upper_bound(all(dis), w);
	cout << (dis_i - 1 != dis.begin() ? deg_s[deg_i - deg.begin() - 1] : "C") << " " << dis_i - dis.begin() - 1 << endl;
}

Submission Info

Judge Result