Submission #886298


Source Code Expand

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

// 基本テンプレート
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x; i<=(int)n; ++i)
#define ILP while(true)
#define FOR(i,c) for(__typeof((c).begin())!=(c).begin(); i!=(c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp make_pair
#pragma endregion

// 型
#pragma region TYPE_DEF
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long> vl;
typedef vector<long long> vll;
typedef vector<string> vs;
#pragma endregion

// Effective std
#pragma region ESTD
template<typename C, typename T> int count(C& c, T t) { return count(ALL(c), t); }
template<typename C, typename F> int count_if(C& c, F f) { return count_if(ALL(c), f); }
template<typename C, typename T> void erase(C& c, T t) { remove(ALL(c), t), c.end(); }
template<typename C> void remove(vector<C>& c, unsigned int index) { c.erase(c.begin()+index); }
template<typename C, typename T, typename U> void replace(C& c, T t, U u) { replace(ALL(c), t, u); }
template<typename C, typename F, typename U> void replace_if(C& c, F f, U u) { (ALL(c), f, u); }
template<typename C> void reverse(C& c) { reverse(ALL(c)); }
template<typename C> void sort(C& c) { sort(ALL(c)); }
template<typename C, typename Pred> void sort(C& c, Pred p) { sort(ALL(c), p); }
#pragma endregion

// 定数
#pragma region CONST_VAL
constexpr int PI = (2*acos(0.0));
constexpr int EPS = (1e-9);
constexpr int MOD = (int)(1e9+7);
constexpr int INF = 100000000;
#pragma endregion

string directions[16] = {
    "N", "NNE", "NE", "ENE",
    "E", "ESE", "SE", "SSE",
    "S", "SSW", "SW", "WSW",
    "W", "WNW", "NW", "NNW"
};

pii speed[14] = {
    pii(0, 0), pii(1, 18), pii(2, 96), pii(3, 204),
    pii(4, 330), pii(5, 480), pii(6, 648), pii(7, 834),
    pii(8, 1032), pii(9, 1248), pii(10, 1470), pii(11, 1710),
    pii(12, 1962), pii(12, 12003)
};

int main()
{
    int deg, wind, i;
    cin >> deg >> wind;
    i = 0;
    wind += 3;
    while(wind >= speed[i].second) {
        ++i;
    }

    --i;
    if(i==0) P("C 0");
    else cout << directions[((deg*10+1125)/2250)%16] + " " << speed[i].first << endl;
    return 0;
}

Submission Info

Submission Time
Task C - 風力観測
User noconocolib
Language C++11 (GCC 4.8.1)
Score 100
Code Size 2620 Byte
Status AC
Exec Time 31 ms
Memory 976 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 28 ms 924 KB
00_sample_02.txt AC 25 ms 976 KB
00_sample_03.txt AC 26 ms 924 KB
00_sample_04.txt AC 27 ms 928 KB
00_sample_05.txt AC 27 ms 924 KB
00_sample_06.txt AC 28 ms 928 KB
00_sample_07.txt AC 27 ms 924 KB
00_sample_08.txt AC 27 ms 928 KB
test_01.txt AC 25 ms 928 KB
test_02.txt AC 27 ms 924 KB
test_03.txt AC 25 ms 828 KB
test_04.txt AC 25 ms 944 KB
test_05.txt AC 27 ms 924 KB
test_06.txt AC 27 ms 924 KB
test_07.txt AC 27 ms 924 KB
test_08.txt AC 27 ms 832 KB
test_09.txt AC 26 ms 920 KB
test_10.txt AC 26 ms 928 KB
test_11.txt AC 26 ms 924 KB
test_12.txt AC 27 ms 928 KB
test_13.txt AC 26 ms 924 KB
test_14.txt AC 30 ms 924 KB
test_15.txt AC 28 ms 804 KB
test_16.txt AC 29 ms 928 KB
test_17.txt AC 30 ms 932 KB
test_18.txt AC 30 ms 928 KB
test_19.txt AC 28 ms 800 KB
test_20.txt AC 30 ms 924 KB
test_21.txt AC 28 ms 928 KB
test_22.txt AC 28 ms 804 KB
test_23.txt AC 28 ms 928 KB
test_24.txt AC 28 ms 800 KB
test_25.txt AC 29 ms 924 KB
test_26.txt AC 29 ms 792 KB
test_27.txt AC 30 ms 808 KB
test_28.txt AC 28 ms 792 KB
test_29.txt AC 28 ms 800 KB
test_30.txt AC 25 ms 796 KB
test_31.txt AC 28 ms 924 KB
test_32.txt AC 31 ms 924 KB
test_33.txt AC 28 ms 928 KB
test_34.txt AC 28 ms 716 KB
test_35.txt AC 28 ms 928 KB
test_36.txt AC 25 ms 924 KB
test_37.txt AC 26 ms 928 KB
test_38.txt AC 26 ms 924 KB
test_39.txt AC 26 ms 928 KB
test_40.txt AC 26 ms 932 KB
test_41.txt AC 26 ms 928 KB
test_42.txt AC 27 ms 924 KB
test_43.txt AC 27 ms 816 KB
test_44.txt AC 27 ms 944 KB
test_45.txt AC 26 ms 928 KB
test_46.txt AC 26 ms 928 KB
test_47.txt AC 24 ms 932 KB
test_48.txt AC 27 ms 872 KB
test_49.txt AC 27 ms 932 KB
test_50.txt AC 27 ms 808 KB
test_51.txt AC 27 ms 928 KB
test_52.txt AC 26 ms 924 KB
test_53.txt AC 26 ms 928 KB
test_54.txt AC 26 ms 928 KB
test_55.txt AC 26 ms 924 KB
test_56.txt AC 26 ms 936 KB
test_57.txt AC 26 ms 712 KB
test_58.txt AC 27 ms 932 KB