Submission #367280

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;

typedef long long ll;

pair<char const*, int> dirTbl[15] = {
    { "NNE", 338 },
    { "NE", 563 },
    { "ENE", 788 },
    { "E", 1013 },

    { "ESE", 1238 },
    { "SE", 1463 },
    { "SSE", 1688 },
    { "S", 1913  },

    { "SSW", 2138 },
    { "SW", 2363 },
    { "WSW", 2588 },
    { "W", 2813 },

    { "WNW", 3038 },
    { "NW", 3263 },
    { "NNW", 3488  },
 
};

int powerTbl[12] = {2, 15, 33, 54, 79, 107, 138, 171, 207, 244, 284, 326};

int main() {

    int Deg;
    int Dis;
    cin >> Deg >> Dis;
    
    
    int mps = int((Dis / 6.0) + 0.5);       // 10倍されてる
    int power = 12;
    for (int i = 0; i < 12; ++i)
    {
        if (mps <= powerTbl[i])
        {
            power = i;
            break;
        }
    }
    
    if (power == 0)
    {
        cout << "C " << power;
        return 0;
    }
    
    char const* dir = "N";
    for (int i = 0; i < 15; ++i)
    {
        if (Deg < dirTbl[i].second)
        {
            dir = dirTbl[i].first;
            break;
        }
    }
    
    cout << dir << " " << power << endl;
    
    return 0;
}

Submission Info

Judge Result