Submission #1355516
Source Code Expand
#include <iostream> #include <cmath> #include <vector> #include <string> #include <map> #include <algorithm> #include <tuple> using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; #define out(S) cout<<(S)<<endl; #define REP(i,b) for(size_t i=0;i<(b);i++) #define rREP(i,b) for(int i=(b)-1;i>=0;i--) #define FOR(i,a,b) for(size_t i=(a);i<(b);i++) #define rFOR(i,a,b) for(int i=(b)-1;i>=0;i--) #define Foreach(item,collection) for(auto item:collection) #define mod(i) ((i) % (ll)(1e9 + 7)) ll modpow(ll i, ll j) { ll tmp = 1; while (j) { if (j % 2)tmp = mod(tmp*i); i = mod(i*i); j /= 2; }return tmp; } #define divmod(a,b) (mod(a * modpow((ll)b,(ll)(1e9 + 5)))) #define Yes out("Yes") #define No out("No") #define NO out("NO") #define YES out("YES") #define INF 2e10; #define ShowAll(collection) for(auto i:collection){out(i);} #define IfOut(condition,text) if((condition)){out(text);return 0;} #define IfeOut(condition,itext,etext) if(condition){out(itext);return 0;}else{out(etext);return 0;} #define Select(collection,condition,result) Foreach(i,collection){result+=condition;} #define GetAuto(_N,vect) {vect.resize(N);REP(i,_N){cin>>vect[i];}} template<typename T> pair<vector<T>,int> getAuto() {int N; cin >> N; pair<vector<T>, int> rt;rt.first.resize(N);rt.second = N;REP(i, N) cin >> rt.first[i];return rt;} void removeAt(string& s, int index) { s.erase(index, 1); } template<typename T> void removeAt(vector<T>& v, int index) { v.erase(v.begin() + index); } ll manhattanDistance(ll x1, ll y1, ll x2, ll y2) { return (abs(x2 - x1) + abs(y2 - y1)); } int main() { int Deg, Dis; cin >> Deg >> Dis; double interval = 112.5; int dir = 0; FOR(i, 0, 16) { if (Deg <= (1 + i * 2)*interval) { dir = i; break; } } string sDir = ""; if (dir == 0) sDir = "N"; else if (dir == 1) sDir = "NNE"; else if (dir == 2) sDir = "NE"; else if (dir == 3) sDir = "ENE"; else if (dir == 4) sDir = "E"; else if (dir == 5) sDir = "ESE"; else if (dir == 6) sDir = "SE"; else if (dir == 7) sDir = "SSE"; else if (dir == 8) sDir = "S"; else if (dir == 9) sDir = "SSW"; else if (dir == 10) sDir = "SW"; else if (dir == 11) sDir = "WSW"; else if (dir == 12) sDir = "W"; else if (dir == 13) sDir = "WNW"; else if (dir == 14) sDir = "NW"; else if (dir == 15) sDir = "NNW"; int speed = ((double)Dis / 60*10+0.5); int W = 0; 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; if (W == 0) sDir = "C"; cout << sDir << " " << W << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 風力観測 |
User | xztaityozx |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2911 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | all | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
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 | 1 ms | 256 KB |
00_sample_02.txt | AC | 1 ms | 256 KB |
00_sample_03.txt | AC | 1 ms | 256 KB |
00_sample_04.txt | AC | 1 ms | 256 KB |
00_sample_05.txt | AC | 1 ms | 256 KB |
00_sample_06.txt | AC | 1 ms | 256 KB |
00_sample_07.txt | AC | 1 ms | 256 KB |
00_sample_08.txt | AC | 1 ms | 256 KB |
test_01.txt | AC | 1 ms | 256 KB |
test_02.txt | AC | 1 ms | 256 KB |
test_03.txt | AC | 1 ms | 256 KB |
test_04.txt | AC | 1 ms | 256 KB |
test_05.txt | AC | 1 ms | 256 KB |
test_06.txt | AC | 1 ms | 256 KB |
test_07.txt | AC | 1 ms | 256 KB |
test_08.txt | AC | 1 ms | 256 KB |
test_09.txt | AC | 1 ms | 256 KB |
test_10.txt | AC | 1 ms | 256 KB |
test_11.txt | AC | 1 ms | 256 KB |
test_12.txt | AC | 1 ms | 256 KB |
test_13.txt | AC | 1 ms | 256 KB |
test_14.txt | AC | 1 ms | 256 KB |
test_15.txt | AC | 1 ms | 256 KB |
test_16.txt | AC | 1 ms | 256 KB |
test_17.txt | AC | 1 ms | 256 KB |
test_18.txt | AC | 1 ms | 256 KB |
test_19.txt | AC | 1 ms | 256 KB |
test_20.txt | AC | 1 ms | 256 KB |
test_21.txt | AC | 1 ms | 256 KB |
test_22.txt | AC | 1 ms | 256 KB |
test_23.txt | AC | 1 ms | 256 KB |
test_24.txt | AC | 1 ms | 256 KB |
test_25.txt | AC | 1 ms | 256 KB |
test_26.txt | AC | 1 ms | 256 KB |
test_27.txt | AC | 1 ms | 256 KB |
test_28.txt | AC | 1 ms | 256 KB |
test_29.txt | AC | 1 ms | 256 KB |
test_30.txt | AC | 1 ms | 256 KB |
test_31.txt | AC | 1 ms | 256 KB |
test_32.txt | AC | 1 ms | 256 KB |
test_33.txt | AC | 1 ms | 256 KB |
test_34.txt | AC | 1 ms | 256 KB |
test_35.txt | AC | 1 ms | 256 KB |
test_36.txt | AC | 1 ms | 256 KB |
test_37.txt | AC | 1 ms | 256 KB |
test_38.txt | AC | 1 ms | 256 KB |
test_39.txt | AC | 1 ms | 256 KB |
test_40.txt | AC | 1 ms | 256 KB |
test_41.txt | AC | 1 ms | 256 KB |
test_42.txt | AC | 1 ms | 256 KB |
test_43.txt | AC | 1 ms | 256 KB |
test_44.txt | AC | 1 ms | 256 KB |
test_45.txt | AC | 1 ms | 256 KB |
test_46.txt | AC | 1 ms | 256 KB |
test_47.txt | AC | 1 ms | 256 KB |
test_48.txt | AC | 1 ms | 256 KB |
test_49.txt | AC | 1 ms | 256 KB |
test_50.txt | AC | 1 ms | 256 KB |
test_51.txt | AC | 1 ms | 256 KB |
test_52.txt | AC | 1 ms | 256 KB |
test_53.txt | AC | 1 ms | 256 KB |
test_54.txt | AC | 1 ms | 256 KB |
test_55.txt | AC | 1 ms | 256 KB |
test_56.txt | AC | 1 ms | 256 KB |
test_57.txt | AC | 1 ms | 256 KB |
test_58.txt | AC | 1 ms | 256 KB |