AtCoder Beginner Contest 001

Submission #3382762

Source codeソースコード

#include <bits/stdc++.h>
using namespace std;

#define FOR(i,s,e) for(int i=s;i<e;i++)
#define RFOR(i,s,e) for(int i=s;i>=e;i--)

#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))

#define SORT(arr) sort(arr, arr + ARRAY_LENGTH(arr))
#define MAX(arr) *max_element(arr, arr + ARRAY_LENGTH(arr))
#define MAXID(arr) distance(arr,max_element(arr, arr + ARRAY_LENGTH(arr)))
#define MIN(arr) *min_element(arr, arr + ARRAY_LENGTH(arr))
#define MINID(arr) distance(arr,min_element(arr, arr + ARRAY_LENGTH(arr)))
#define NID(arr,x) distance(arr,find(arr, arr + ARRAY_LENGTH(arr),x))

#define INF 1000000000
#define EPS (1e-7)



//lower bound
int NNE = 113, NE = 338, ENE = 563, E = 788, ESE = 1013, SE = 1238;
int SSE = 1463, S = 1688, SSW = 1913, SW = 2138, WSW = 2363, W = 2588;
int WNW = 2813, NW = 3038, NNW = 3263;


int W1 = 3, W2 = 16, W3 = 34, W4 = 55, W5 = 80, W6 = 108, W7 = 139, W8 = 172;
int W9 = 208, W10 = 245, W11 = 285, W12 = 327;

int Deg, Dis;

string ansDeg;
int ansDis;

int main(){
	cin >> Deg >> Dis;
	if (Deg < NNE) ansDeg = "N";
	else if(NNE <= Deg && Deg < NE) ansDeg = "NNE";
	else if(NE <= Deg && Deg < ENE) ansDeg = "NE";
	else if(ENE <= Deg && Deg < E) ansDeg = "ENE";
	else if(E <= Deg && Deg < ESE) ansDeg = "E";
	else if(ESE <= Deg && Deg < SE) ansDeg = "ESE";
	else if(SE <= Deg && Deg < SSE) ansDeg = "SE";
	else if(SSE <= Deg && Deg < S) ansDeg = "SSE";
	else if(S <= Deg && Deg < SSW) ansDeg = "S";
	else if(SSW <= Deg && Deg < SW) ansDeg = "SSW";
	else if(SW <= Deg && Deg < WSW) ansDeg = "SW";
	else if(WSW <= Deg && Deg < W) ansDeg = "WSW";
	else if(W <= Deg && Deg < WNW) ansDeg = "W";
	else if(WNW <= Deg && Deg < NW) ansDeg = "WNW";
	else if(NW <= Deg && Deg < NNW) ansDeg = "NW";
	else if(NNW <= Deg && Deg < 3488) ansDeg = "NNW";
	else if(3488 <= Deg) ansDeg = "N";
	Dis = Dis*10;
	if (Dis < 25*6) {ansDis = 0; ansDeg = "C";}
	else if(25*6 <= Dis && Dis < 155*6) ansDis = 1;
	else if(155*6 <= Dis && Dis < 335*6) ansDis = 2;
	else if(335*6 <= Dis && Dis < 545*6) ansDis = 3;
	else if(545*6 <= Dis && Dis < 795*6) ansDis = 4;
	else if(795*6 <= Dis && Dis < 1075*6) ansDis = 5;
	else if(1075*6 <= Dis && Dis < 1385*6) ansDis = 6;
	else if(1385*6 <= Dis && Dis < 1715*6) ansDis = 7;
	else if(1715*6 <= Dis && Dis < 2075*6) ansDis = 8;
	else if(2075*6 <= Dis && Dis < 2445*6) ansDis = 9;
	else if(2445*6 <= Dis && Dis < 2845*6) ansDis = 10;
	else if(2845*6 <= Dis && Dis < 3265*6) ansDis = 11;
	else if(3265*6 <= Dis ) ansDis = 12;


	cout << ansDeg << " " << ansDis << endl;
	return 0;
}

Submission

Task問題 C - 風力観測
User nameユーザ名 ASAKO
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 100
Source lengthソースコード長 2606 Byte
File nameファイル名
Exec time実行時間 1 ms
Memory usageメモリ使用量 256 KB

Test case

Set

Set name Score得点 / Max score Cases
all 100 / 100 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
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