Submission #3389811


Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <vector>
#include <cstdio>
#include <bits/stdc++.h>
#include <set>
#include <map>
#include <stdio.h>
#include <stack>
#include <queue>
#include <deque>
#include <numeric>
#include<bits/stdc++.h>
#include <utility>

#define ALL(obj) (obj).begin(), (obj).end()
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define RFOR(i,a,b) for(int i = (a); (b) <= i; i--)
#define REP(i,n) for(int i = 0; i < (n); i++)
#define RREP(i,n) for(int i = n; n <= i; i--)
#define ABS(a) ((a < 0) ? ((-1)*(a)) : (a))
#define elif else if
#define MOD 1000000007
#define INF (1<<29)

using namespace std;
using ll = long long;
map <int ,int> mpa,mpb;
typedef pair<ll, ll> P;
priority_queue<P, vector<P>, greater<P>> pque;

int main(){
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int D,W;
  cin >> D >> W;
  string x[]={"NNE","NE","ENE","E","ESE","SE","SSE","S","SSW","SW","WSW","W","WNW","NW","NNW","N","C"};
  int d=112.5;
  int cnt=0;
  while(1){
    d%=3600;
    if(d<=D && D<d+225){
      break;
    }else{
      cnt++;
    }
  }

  double n[13]={0.2,1.5,3.3,5.4,7.9,10.7,13.8,17.1,20.7,24.4,28.4,32.6,203};
  for(int i=0;i<13;i++){
    n[i]*=60;
  }
  int q=0;
  while(1){
    if(W<=n[q]){
      break;
    }else{
      q++;
    }
  }
  if(q==0){
    cnt=16;
  }
  cout << x[cnt] << " " << q << endl;
  return 0;
}

Submission Info

Submission Time
Task C - 風力観測
User arks1225
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1455 Byte
Status WA
Exec Time 2107 ms
Memory 256 KB

Judge Result

Set Name all
Score / Max Score 0 / 100
Status
AC × 3
WA × 1
TLE × 62
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 TLE 2103 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt TLE 2103 ms 256 KB
00_sample_04.txt TLE 2103 ms 256 KB
00_sample_05.txt TLE 2103 ms 256 KB
00_sample_06.txt TLE 2103 ms 256 KB
00_sample_07.txt AC 1 ms 256 KB
00_sample_08.txt TLE 2103 ms 256 KB
test_01.txt TLE 2103 ms 256 KB
test_02.txt TLE 2103 ms 256 KB
test_03.txt TLE 2103 ms 256 KB
test_04.txt TLE 2103 ms 256 KB
test_05.txt TLE 2103 ms 256 KB
test_06.txt TLE 2103 ms 256 KB
test_07.txt TLE 2103 ms 256 KB
test_08.txt TLE 2103 ms 256 KB
test_09.txt TLE 2103 ms 256 KB
test_10.txt TLE 2103 ms 256 KB
test_11.txt TLE 2103 ms 256 KB
test_12.txt TLE 2103 ms 256 KB
test_13.txt TLE 2103 ms 256 KB
test_14.txt TLE 2103 ms 256 KB
test_15.txt TLE 2103 ms 256 KB
test_16.txt TLE 2103 ms 256 KB
test_17.txt TLE 2103 ms 256 KB
test_18.txt TLE 2103 ms 256 KB
test_19.txt TLE 2103 ms 256 KB
test_20.txt TLE 2103 ms 256 KB
test_21.txt TLE 2103 ms 256 KB
test_22.txt TLE 2103 ms 256 KB
test_23.txt TLE 2103 ms 256 KB
test_24.txt TLE 2103 ms 256 KB
test_25.txt TLE 2103 ms 256 KB
test_26.txt TLE 2103 ms 256 KB
test_27.txt WA 1 ms 256 KB
test_28.txt TLE 2103 ms 256 KB
test_29.txt TLE 2103 ms 256 KB
test_30.txt TLE 2103 ms 256 KB
test_31.txt TLE 2103 ms 256 KB
test_32.txt TLE 2103 ms 256 KB
test_33.txt TLE 2103 ms 256 KB
test_34.txt TLE 2103 ms 256 KB
test_35.txt TLE 2103 ms 256 KB
test_36.txt TLE 2103 ms 256 KB
test_37.txt TLE 2103 ms 256 KB
test_38.txt TLE 2103 ms 256 KB
test_39.txt TLE 2103 ms 256 KB
test_40.txt TLE 2103 ms 256 KB
test_41.txt TLE 2103 ms 256 KB
test_42.txt TLE 2103 ms 256 KB
test_43.txt AC 1 ms 256 KB
test_44.txt TLE 2103 ms 256 KB
test_45.txt TLE 2103 ms 256 KB
test_46.txt TLE 2103 ms 256 KB
test_47.txt TLE 2103 ms 256 KB
test_48.txt TLE 2103 ms 256 KB
test_49.txt TLE 2103 ms 256 KB
test_50.txt TLE 2103 ms 256 KB
test_51.txt TLE 2103 ms 256 KB
test_52.txt TLE 2103 ms 256 KB
test_53.txt TLE 2103 ms 256 KB
test_54.txt TLE 2103 ms 256 KB
test_55.txt TLE 2103 ms 256 KB
test_56.txt TLE 2103 ms 256 KB
test_57.txt TLE 2107 ms 256 KB
test_58.txt TLE 2103 ms 256 KB