AtCoder Beginner Contest 001

Submission #109108

Source codeソースコード

#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>

using namespace std;

#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)

//4方向ベクトル→↑←↓
int dx[] ={1,0,-1,0};
int dy[] ={0,-1,0,1};
double deg;
long temp;
int main()
{
  double dir;
  cin >>deg>>dir;
  deg /=10;
  dir /=60.0;
  dir *=10;
  dir =round(dir);
  dir /=10;
  double hougaku[100];
  double d =11.25;
  for(int i = 0;i <=15;i++){
    hougaku[i] =d;
    d +=22.50;
  }
  int u = 0;
  for(int i = 0;i <=16;i++){
    if(dir >=0.0&&dir <=0.2){
      cout<<"C";
      break;
	}
    if(i ==16&&u == 0){
      cout <<"N";
      break;
    }
    if(deg >=hougaku[i]&&deg<hougaku[i+1])
      switch(i){
      case 0:
	cout <<"NNE";
	u = 1;
	break;
      case 1:
	cout <<"NE";
	u = 1;
	  break;
      case 2:
	cout <<"ENE";
	u = 1;
	  break;
      case 3:
	cout <<"E";
	u = 1;
	  break;
      case 4:
	cout <<"ESE";
	u = 1;
	  break;
      case 5:
	cout <<"SE";
	u = 1;
	break;
      case 6:
	cout <<"SSE";
	u = 1;
	  break;
      case 7:
	cout <<"S";
	u = 1;
	break;
      case 8:
	cout <<"SSW";
	u = 1;
	break;
      case 9:
	cout <<"SW";
	u = 1;
	  break;
      case 10:
	cout <<"WSW";
	u = 1;
	break;
      case 11:
	cout <<"W";
	u  =1;
	  break;
      case 12:
	cout <<"WNW";
	u = 1;
	break;
      case 13:
	cout <<"NW";
	u = 1;
	break;
      case 14:
	cout <<"NNW";
	u  =1;
	break;
      default:
	break;
      }
  }
  cout <<" ";
  if(dir >=0.0&&dir<=0.2)
    cout <<"0";
  else if(dir >=0.3&&dir<=1.5)
    cout <<"1";
  else if(dir >=1.6&&dir <=3.3)
    cout <<"2";
  else if(dir >=3.4&&dir <=5.4)
    cout <<"3";
  else if(dir >=5.5&&dir <=7.9)
    cout <<"4";
  else if(dir >=8.0&&dir<=10.7)
    cout <<"5";
  else if(dir >=10.8&&dir <=13.8)
    cout <<"6";
  else if(dir >=13.9&&dir <=17.1)
    cout <<"7";
  else if(dir >=17.2&&dir<=20.7)
    cout <<"8";
  else if(dir >=20.8&&dir <=24.4)
    cout <<"9";
  else if(dir >=24.5&&dir <=28.4)
    cout <<"10";
  else if(dir >=28.5&&dir <=32.6)
    cout <<"11";
  else
    cout <<"12";
  cout <<endl;
  return 0;
}








Submission

Task問題 C - 風力観測
User nameユーザ名 togatoga
Created time投稿日時
Language言語 C++ (G++ 4.6.4)
Status状態 AC
Score得点 100
Source lengthソースコード長 2649 Byte
File nameファイル名
Exec time実行時間 24 ms
Memory usageメモリ使用量 932 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 21 ms 916 KB
00_sample_02.txt AC 22 ms 676 KB
00_sample_03.txt AC 20 ms 804 KB
00_sample_04.txt AC 23 ms 796 KB
00_sample_05.txt AC 23 ms 804 KB
00_sample_06.txt AC 22 ms 748 KB
00_sample_07.txt AC 22 ms 808 KB
00_sample_08.txt AC 22 ms 736 KB
test_01.txt AC 22 ms 932 KB
test_02.txt AC 21 ms 792 KB
test_03.txt AC 22 ms 932 KB
test_04.txt AC 21 ms 804 KB
test_05.txt AC 22 ms 804 KB
test_06.txt AC 22 ms 800 KB
test_07.txt AC 21 ms 928 KB
test_08.txt AC 22 ms 800 KB
test_09.txt AC 20 ms 804 KB
test_10.txt AC 22 ms 796 KB
test_11.txt AC 20 ms 796 KB
test_12.txt AC 22 ms 924 KB
test_13.txt AC 23 ms 736 KB
test_14.txt AC 23 ms 808 KB
test_15.txt AC 23 ms 932 KB
test_16.txt AC 23 ms 928 KB
test_17.txt AC 22 ms 932 KB
test_18.txt AC 22 ms 792 KB
test_19.txt AC 22 ms 804 KB
test_20.txt AC 21 ms 800 KB
test_21.txt AC 22 ms 932 KB
test_22.txt AC 21 ms 928 KB
test_23.txt AC 22 ms 716 KB
test_24.txt AC 21 ms 932 KB
test_25.txt AC 23 ms 744 KB
test_26.txt AC 23 ms 804 KB
test_27.txt AC 21 ms 804 KB
test_28.txt AC 23 ms 808 KB
test_29.txt AC 20 ms 804 KB
test_30.txt AC 21 ms 924 KB
test_31.txt AC 22 ms 804 KB
test_32.txt AC 23 ms 920 KB
test_33.txt AC 23 ms 800 KB
test_34.txt AC 23 ms 804 KB
test_35.txt AC 22 ms 808 KB
test_36.txt AC 23 ms 804 KB
test_37.txt AC 23 ms 804 KB
test_38.txt AC 22 ms 680 KB
test_39.txt AC 22 ms 928 KB
test_40.txt AC 21 ms 804 KB
test_41.txt AC 22 ms 800 KB
test_42.txt AC 22 ms 800 KB
test_43.txt AC 22 ms 928 KB
test_44.txt AC 22 ms 808 KB
test_45.txt AC 24 ms 804 KB
test_46.txt AC 22 ms 912 KB
test_47.txt AC 23 ms 676 KB
test_48.txt AC 20 ms 804 KB
test_49.txt AC 22 ms 800 KB
test_50.txt AC 23 ms 680 KB
test_51.txt AC 23 ms 920 KB
test_52.txt AC 23 ms 796 KB
test_53.txt AC 22 ms 800 KB
test_54.txt AC 21 ms 804 KB
test_55.txt AC 22 ms 924 KB
test_56.txt AC 22 ms 932 KB
test_57.txt AC 22 ms 928 KB
test_58.txt AC 22 ms 800 KB