Submission #678471


Source Code Expand

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

typedef ostringstream OSS; typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII;  typedef pair<LL, LL> PLL;
typedef vector<int>    VI;   typedef vector<VI>   VVI;   typedef vector<VVI>   VVVI;
typedef vector<LL>     VLL;  typedef vector<VLL>  VVLL;  typedef vector<VVLL>  VVVLL;
typedef vector<double> VD;   typedef vector<VD>   VVD;   typedef vector<VVD>   VVVD;
typedef vector<string> VS;   typedef vector<VS>   VVS;   typedef vector<VVS>   VVVS;
typedef vector<bool>   VB;   typedef vector<VB>   VVB;   typedef vector<VVB>   VVVB;
typedef vector<PII>    VPII; typedef vector<VPII> VVPII; typedef vector<VVPII> VVVPII;
typedef vector<PLL>    VPLL; typedef vector<VPLL> VVPLL; typedef vector<VVPLL> VVVPLL;

#define fst first
#define snd second
// #define Y first
// #define X second
#define MP make_pair
#define PB push_back
#define EB emplace_back 
#define ALL(x)  (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define RANGEBOX(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
#define RANGE(x, l, r) ((l) <= (x) && (x) <= (r))
#define rep(i, N)  for (int i = 0; i < (int)(N); i++)
#define rrep(i, N) for (int i = N - 1; i >= 0; i--)
#define REP(i, init, N)  for (int i = (init); i < (int)(N); i++)
#define RREP(i, N, last) for (int i = (init - 1); i >= last; i--)
#define MAXUD(orig, target) orig = max(orig, target)
#define MINUD(orig, target) orig = min(orig, target)
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

template < typename T > inline T fromString(const string &s) { T res; ISS iss(s); iss >> res; return res; };
template < typename T > inline string toString(const T &a)   { OSS oss; oss << a; return oss.str(); };

const int    INF  = 0x3f3f3f3f;
const LL     INFL = 0x3f3f3f3f3f3f3f3fLL;
const double DINF = 0x3f3f3f3f;
const int    DX[] = {1,  0, -1, 0};
const int    DY[] = {0, -1,  0, 1};
const double EPS  = 1e-12;
// const double PI   = acos(-1.0);
// lambda: [](T1 x)->T2{return y;}
// simple lambda: [](T x){return x;}

const VS dirs({"N","NNE","NE","ENE","E","ESE","SE","SSE","S","SSW","SW","WSW","W","WNW","NW","NNW","N"});
const VI degs({0, 1125, 3375, 5625, 7875, 10125, 12375, 14625, 16875, 19125, 21375, 23625, 25875, 28125, 30375, 32625, 34875});

const VI wings({0, 3, 16, 34, 55, 80, 108, 139, 172, 208, 245, 285, 327});

int main(void) {
    int deg, dis;
    cin >> deg >> dis;

    string dir = dirs[lower_bound(ALL(degs), deg * 10 + 1) - degs.begin() - 1];
    
    int w = lower_bound(ALL(wings), round(dis / 6.) + 1) - wings.begin() - 1;

    cout << (w ? dir : "C") << " " << w << endl;

	return 0;
}

Submission Info

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