Submission #124700


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <cstring>
#include <cctype>
#include <climits>
#include <sstream>
#include <set>
#include <map>
#include <queue>
#include <complex>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for(int i = a; i < (int)b; i++)
#define FOREQ(i,a,b) for(int i = a; i <= (int)b; i++)
#define FOREACH(it, c) for(__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALL(c) (c).begin(), (c).end()
#define SZ(c) (c).size()
template <class T> void pp(T v) { FOREACH(it, v) cout << *it << ' '; cout << endl ; }
template <class T> void pp(T v, int n) { REP(i,n) cout<<v[i]<< ' '; cout << endl; }
template <class T> inline void chmax(T &a, const T b) { a = max(a, b); }
template <class T> inline void chmin(T &a, const T b) { a = min(a, b); }
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef complex<double> P;
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef unsigned uint;
const int INF = 1<<28;
const double EPS = 1.0e-9;
static const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
#undef MOD_CALC
#ifdef MOD_CALC
const ll MOD = 1000 * 1000 * 1000 + 7;
inline void chadd(ll &a, const ll b) { a = (a + b) % MOD;}
inline ll add(const ll a, const ll b){ return (a + b) %  MOD;}
inline void chsub(ll &a, const ll b) { a = (a - b + MOD) % MOD;}
inline ll sub(const ll a, const ll b){ return (a - b + MOD) % MOD; }
inline void chmul(ll &a, const ll b) { a = (a * b) %  MOD;}
inline ll mul(const ll a, const ll b){ return (a * b) %  MOD;}
#endif

int main(void)
{

	double deg;
	int dis;
	cin>>deg>>dis;
	deg /= 10.0;
	string dir = "C";
	int w = 0;
	int speed = (int)(dis / 60.0 * 10.0 + 0.5);
	if(speed <= 2) w = 0;
	else if(speed <= 15) w = 1;
	else if(speed <= 33) w = 2;
	else if(speed <= 54) w = 3;
	else if(speed <= 79) w = 4;
	else if(speed <= 107) w = 5;
	else if(speed <= 138) w = 6;
	else if(speed <= 171) w = 7;
	else if(speed <= 207) w = 8;
	else if(speed <= 244) w = 9;
	else if(speed <= 284) w = 10;
	else if(speed <= 326) w = 11;
	else w = 12;
	double a = 22.5, b = a / 2.0;
	const string DIR[17] = {
			"N", "NNE", "NE", "ENE",
			"E", "ESE", "SE", "SSE",
			"S", "SSW", "SW", "WSW",
			"W", "WNW", "NW", "NNW",
			"N"
	};
	if(w > 0) {
		for(int i = 0; i < 17; i++) {
			if(deg < b + i * a) {
				dir = DIR[i]; break;
			}
		}
	}
	cout << dir << " " << w << endl;
    return 0;
}

Submission Info

Submission Time
Task C - 風力観測
User kmatsunaga
Language C++ (G++ 4.6.4)
Score 100
Code Size 2672 Byte
Status AC
Exec Time 23 ms
Memory 932 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 66
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 00_sample_06.txt, 00_sample_07.txt, 00_sample_08.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt, test_56.txt, test_57.txt, test_58.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 22 ms 796 KB
00_sample_02.txt AC 23 ms 804 KB
00_sample_03.txt AC 21 ms 804 KB
00_sample_04.txt AC 22 ms 800 KB
00_sample_05.txt AC 22 ms 732 KB
00_sample_06.txt AC 20 ms 804 KB
00_sample_07.txt AC 21 ms 804 KB
00_sample_08.txt AC 20 ms 804 KB
test_01.txt AC 22 ms 804 KB
test_02.txt AC 22 ms 800 KB
test_03.txt AC 23 ms 924 KB
test_04.txt AC 22 ms 804 KB
test_05.txt AC 20 ms 800 KB
test_06.txt AC 22 ms 680 KB
test_07.txt AC 22 ms 804 KB
test_08.txt AC 20 ms 804 KB
test_09.txt AC 22 ms 840 KB
test_10.txt AC 22 ms 800 KB
test_11.txt AC 22 ms 932 KB
test_12.txt AC 22 ms 800 KB
test_13.txt AC 23 ms 800 KB
test_14.txt AC 22 ms 804 KB
test_15.txt AC 22 ms 804 KB
test_16.txt AC 22 ms 804 KB
test_17.txt AC 21 ms 804 KB
test_18.txt AC 22 ms 796 KB
test_19.txt AC 22 ms 800 KB
test_20.txt AC 22 ms 800 KB
test_21.txt AC 22 ms 808 KB
test_22.txt AC 22 ms 804 KB
test_23.txt AC 20 ms 796 KB
test_24.txt AC 23 ms 712 KB
test_25.txt AC 22 ms 804 KB
test_26.txt AC 22 ms 924 KB
test_27.txt AC 22 ms 800 KB
test_28.txt AC 23 ms 928 KB
test_29.txt AC 21 ms 932 KB
test_30.txt AC 22 ms 804 KB
test_31.txt AC 21 ms 796 KB
test_32.txt AC 21 ms 928 KB
test_33.txt AC 22 ms 928 KB
test_34.txt AC 22 ms 808 KB
test_35.txt AC 22 ms 808 KB
test_36.txt AC 22 ms 800 KB
test_37.txt AC 22 ms 928 KB
test_38.txt AC 22 ms 804 KB
test_39.txt AC 23 ms 932 KB
test_40.txt AC 22 ms 792 KB
test_41.txt AC 22 ms 928 KB
test_42.txt AC 21 ms 800 KB
test_43.txt AC 22 ms 776 KB
test_44.txt AC 21 ms 804 KB
test_45.txt AC 22 ms 808 KB
test_46.txt AC 21 ms 804 KB
test_47.txt AC 21 ms 804 KB
test_48.txt AC 22 ms 808 KB
test_49.txt AC 22 ms 808 KB
test_50.txt AC 22 ms 680 KB
test_51.txt AC 22 ms 804 KB
test_52.txt AC 20 ms 800 KB
test_53.txt AC 20 ms 928 KB
test_54.txt AC 22 ms 920 KB
test_55.txt AC 21 ms 764 KB
test_56.txt AC 21 ms 804 KB
test_57.txt AC 22 ms 736 KB
test_58.txt AC 21 ms 804 KB