Submission #637003


Source Code Expand

#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<cstring>
#include<string>
#include <math.h>
#include<algorithm>
#include<functional>
#define ll long long
#define inf  1000000007
#define pa pair<int,int>
#define pal pair<ll,ll>
#define ppa pair<int,pa>
#define EPS (1e-10)
#define equals(a,b) (fabs((a)-(b))<EPS)

using namespace std;

class Point{
  public:
  double x,y;
  Point(double x=0,double y=0):x(x),y(y) {}
  Point operator + (Point p) {return Point(x+p.x,y+p.y);}
  Point operator - (Point p) {return Point(x-p.x,y-p.y);}
  Point operator * (double a) {return Point(x*a,y*a);}
  Point operator / (double a) {return Point(x/a,y/a);}
  double absv() {return sqrt(norm());}
  double norm() {return x*x+y*y;}
  bool operator < (const Point &p) const{
    return x != p.x ? x<p.x: y<p.y;
  }
  bool operator == (const Point &p) const{
    return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
  }
};
typedef Point Vector;

struct Segment{
Point p1,p2;
};

double hen(Vector a){
if(fabs(a.x)<EPS && a.y>0) return acos(0);
else if(fabs(a.x)<EPS && a.y<0) return 3*acos(0);
else if(fabs(a.y)<EPS && a.x<0) return 2*acos(0);
else if(fabs(a.y)<EPS && a.x>0) return 0.0;
else if(a.y>0) return acos(a.x/a.absv());
else return 2*acos(0)+acos(-a.x/a.absv());

}

double dot(Vector a,Vector b){
  return a.x*b.x+a.y*b.y;
}
double cross(Vector a,Vector b){
  return a.x*b.y-a.y*b.x;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int ru[11]={1,2,4,8,16,32,64,128,256,512,1024};
//----------------kokomade temple------------
vector<int> ve[100005];
int taka[100005];
int oya[20][100005];

int main(){
int a,b;
cin>>a>>b;

if(b<15){
  cout<<"C 0"<<endl;
  return 0;
}

a=a*10;
if(a<1125)cout<<"N ";
else if(a<3375)cout<<"NNE ";
else if(a<5625)cout<<"NE ";
else if(a<7875)cout<<"ENE ";
else if(a<10125)cout<<"E ";
else if(a<12375)cout<<"ESE ";
else if(a<14625)cout<<"SE ";
else if(a<16875)cout<<"SSE ";
else if(a<19125)cout<<"S ";
else if(a<21375)cout<<"SSW ";
else if(a<23625)cout<<"SW ";
else if(a<25875)cout<<"WSW ";
else if(a<28125)cout<<"W ";
else if(a<30375)cout<<"WNW ";
else if(a<32625)cout<<"NW ";
else if(a<34875)cout<<"NNW ";
else cout<<"N ";


if(b<93) cout<<1<<endl;
else if(b<201)cout<<2<<endl;
else if(b<327)cout<<3<<endl;
else if(b<477)cout<<4<<endl;
else if(b<645)cout<<5<<endl;
else if(b<831)cout<<6<<endl;
else if(b<1029)cout<<7<<endl;
else if(b<1245)cout<<8<<endl;
else if(b<1467)cout<<9<<endl;
else if(b<1707)cout<<10<<endl;
else if(b<1959)cout<<11<<endl;
else cout<<12<<endl;
return 0;
}

Submission Info

Submission Time
Task C - 風力観測
User smiken
Language C++ (G++ 4.6.4)
Score 100
Code Size 2679 Byte
Status AC
Exec Time 35 ms
Memory 3236 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 32 ms 3204 KB
00_sample_02.txt AC 28 ms 3204 KB
00_sample_03.txt AC 29 ms 3208 KB
00_sample_04.txt AC 29 ms 3236 KB
00_sample_05.txt AC 27 ms 3200 KB
00_sample_06.txt AC 29 ms 3232 KB
00_sample_07.txt AC 27 ms 3196 KB
00_sample_08.txt AC 29 ms 3204 KB
test_01.txt AC 29 ms 3208 KB
test_02.txt AC 30 ms 3200 KB
test_03.txt AC 28 ms 3204 KB
test_04.txt AC 28 ms 3204 KB
test_05.txt AC 29 ms 3196 KB
test_06.txt AC 28 ms 3204 KB
test_07.txt AC 30 ms 3140 KB
test_08.txt AC 30 ms 3208 KB
test_09.txt AC 29 ms 3232 KB
test_10.txt AC 29 ms 3200 KB
test_11.txt AC 29 ms 3208 KB
test_12.txt AC 27 ms 3204 KB
test_13.txt AC 30 ms 3204 KB
test_14.txt AC 29 ms 3220 KB
test_15.txt AC 31 ms 3208 KB
test_16.txt AC 29 ms 3236 KB
test_17.txt AC 29 ms 3228 KB
test_18.txt AC 30 ms 3228 KB
test_19.txt AC 27 ms 3208 KB
test_20.txt AC 29 ms 3228 KB
test_21.txt AC 29 ms 3228 KB
test_22.txt AC 30 ms 3228 KB
test_23.txt AC 27 ms 3204 KB
test_24.txt AC 29 ms 3232 KB
test_25.txt AC 29 ms 3232 KB
test_26.txt AC 28 ms 3208 KB
test_27.txt AC 29 ms 3220 KB
test_28.txt AC 30 ms 3196 KB
test_29.txt AC 29 ms 3232 KB
test_30.txt AC 27 ms 3228 KB
test_31.txt AC 29 ms 3232 KB
test_32.txt AC 29 ms 3228 KB
test_33.txt AC 29 ms 3232 KB
test_34.txt AC 32 ms 3232 KB
test_35.txt AC 27 ms 3212 KB
test_36.txt AC 29 ms 3200 KB
test_37.txt AC 27 ms 3212 KB
test_38.txt AC 31 ms 3204 KB
test_39.txt AC 30 ms 3232 KB
test_40.txt AC 30 ms 3228 KB
test_41.txt AC 29 ms 3212 KB
test_42.txt AC 29 ms 3232 KB
test_43.txt AC 30 ms 3232 KB
test_44.txt AC 31 ms 3200 KB
test_45.txt AC 31 ms 3228 KB
test_46.txt AC 28 ms 3196 KB
test_47.txt AC 29 ms 3232 KB
test_48.txt AC 30 ms 3188 KB
test_49.txt AC 28 ms 3176 KB
test_50.txt AC 28 ms 3228 KB
test_51.txt AC 31 ms 3208 KB
test_52.txt AC 32 ms 3200 KB
test_53.txt AC 35 ms 3092 KB
test_54.txt AC 32 ms 3132 KB
test_55.txt AC 32 ms 3204 KB
test_56.txt AC 32 ms 3228 KB
test_57.txt AC 31 ms 3208 KB
test_58.txt AC 31 ms 3128 KB