Submission #1681215


Source Code Expand

#include <iostream>
#include <iomanip>
#include <vector>
#include <valarray>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <bitset>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <complex>
#include <string>
#include <sstream>

#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cmath>

using namespace std;

#define all(c) c.begin(),c.end()
#define repeat(i,n) for(int i=0;i<static_cast<int>(n);i++)
#define debug(x) #x << "=" << (x)
#define dump(x) cerr << debug(x) << " (L:" << __LINE__ << ")"<< endl

typedef long long ll;
typedef vector<int> vi;

template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec){
    os << "[";
    for(int i = 0; i < vec.size(); i++){
        os << vec[i] << ",";
    }
    os << "]";
    return os;
}

template<typename T>
T input(){
    T t;
    cin >> t;
    return t;
}

template<typename T>
vector<T> input(const int N){
    vector<T> v(N);
    repeat(i,N) cin >> v[i];
    return v;
}

long long gcd(long long a, long long b){
    if(b == 0){
        return a;
    }
    return gcd(b, a % b);
}

long long lcm(long long a, long long b){
    return (a / gcd(a, b)) * b;
}

string computeWindDirection(long degree) {
    if (112.5 <= degree && degree < 337.5) {
        return "NNE";
    } else if (337.5 <= degree && degree < 562.5) {
        return "NE";
    } else if (562.5 <= degree && degree < 787.5) {
        return "ENE";
    } else if (787.5 <= degree && degree < 1012.5) {
        return "E";
    } else if (1012.5 <= degree && degree < 1237.5) {
        return "ESE";
    } else if (1237.5 <= degree && degree < 1462.5) {
        return "SE";
    } else if (1462.5 <= degree && degree < 1687.5) {
        return "SSE";
    } else if (1687.5 <= degree && degree < 1912.5) {
        return "S";
    } else if (1912.5 <= degree && degree < 2137.5) {
        return "SSW";
    } else if (2137.5 <= degree && degree < 2362.5) {
        return "SW";
    } else if (2362.5 <= degree && degree < 2587.5) {
        return "WSW";
    } else if (2587.5 <= degree && degree < 2812.5) {
        return "W";
    } else if (2812.5 <= degree && degree < 3037.5) {
        return "WNW";
    } else if (3037.5 <= degree && degree < 3262.5) {
        return "NW";
    } else if (3262.5 <= degree && degree < 3487.5) {
        return "NNW";
    } else {
        return "N";
    }
}

int computeWindStrength(long distance) {
    int speed = (int) round(distance * 10.0 / 60.0);

    if (0 <= speed && speed <= 2) {
        return 0;
    } else if (3 <= speed && speed <= 15) {
        return 1;
    } else if (16 <= speed && speed <= 33) {
        return 2;
    } else if (34 <= speed && speed <= 54) {
        return 3;
    } else if (55 <= speed && speed <= 79) {
        return 4;
    } else if (80 <= speed && speed <= 107) {
        return 5;
    } else if (108 <= speed && speed <= 138) {
        return 6;
    } else if (139 <= speed && speed <= 171) {
        return 7;
    } else if (172 <= speed && speed <= 207) {
        return 8;
    } else if (208 <= speed && speed <= 244) {
        return 9;
    } else if (245 <= speed && speed <= 284) {
        return 10;
    } else if (285 <= speed && speed <= 326) {
        return 11;
    } else {
        return 12;
    }
}

int main(){
    long degree, distance;
    cin >> degree >> distance;
    string direction = computeWindDirection(degree);
    int strength = computeWindStrength(distance);

    if (strength == 0) {
        direction = "C";
    }
    cout << direction << " " << strength << endl;
    return 0;
}

Submission Info

Submission Time
Task C - 風力観測
User xeonics
Language C++11 (GCC 4.8.1)
Score 100
Code Size 3640 Byte
Status AC
Exec Time 3 ms
Memory 512 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 3 ms 512 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
00_sample_04.txt AC 1 ms 256 KB
00_sample_05.txt AC 1 ms 256 KB
00_sample_06.txt AC 1 ms 256 KB
00_sample_07.txt AC 1 ms 256 KB
00_sample_08.txt AC 1 ms 256 KB
test_01.txt AC 1 ms 256 KB
test_02.txt AC 1 ms 256 KB
test_03.txt AC 1 ms 256 KB
test_04.txt AC 1 ms 256 KB
test_05.txt AC 1 ms 256 KB
test_06.txt AC 1 ms 256 KB
test_07.txt AC 1 ms 256 KB
test_08.txt AC 1 ms 256 KB
test_09.txt AC 1 ms 256 KB
test_10.txt AC 1 ms 256 KB
test_11.txt AC 1 ms 256 KB
test_12.txt AC 1 ms 256 KB
test_13.txt AC 1 ms 256 KB
test_14.txt AC 1 ms 256 KB
test_15.txt AC 1 ms 256 KB
test_16.txt AC 1 ms 256 KB
test_17.txt AC 1 ms 256 KB
test_18.txt AC 1 ms 256 KB
test_19.txt AC 1 ms 256 KB
test_20.txt AC 1 ms 256 KB
test_21.txt AC 1 ms 256 KB
test_22.txt AC 1 ms 256 KB
test_23.txt AC 1 ms 256 KB
test_24.txt AC 1 ms 256 KB
test_25.txt AC 1 ms 256 KB
test_26.txt AC 1 ms 256 KB
test_27.txt AC 1 ms 256 KB
test_28.txt AC 1 ms 256 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 1 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 1 ms 256 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 1 ms 256 KB
test_37.txt AC 1 ms 256 KB
test_38.txt AC 1 ms 256 KB
test_39.txt AC 1 ms 256 KB
test_40.txt AC 1 ms 256 KB
test_41.txt AC 1 ms 256 KB
test_42.txt AC 1 ms 256 KB
test_43.txt AC 1 ms 256 KB
test_44.txt AC 1 ms 256 KB
test_45.txt AC 1 ms 256 KB
test_46.txt AC 1 ms 256 KB
test_47.txt AC 1 ms 256 KB
test_48.txt AC 1 ms 256 KB
test_49.txt AC 1 ms 256 KB
test_50.txt AC 1 ms 256 KB
test_51.txt AC 1 ms 256 KB
test_52.txt AC 1 ms 256 KB
test_53.txt AC 1 ms 256 KB
test_54.txt AC 1 ms 256 KB
test_55.txt AC 1 ms 256 KB
test_56.txt AC 1 ms 256 KB
test_57.txt AC 1 ms 256 KB
test_58.txt AC 1 ms 256 KB