Submission #3786334


Source Code Expand

// Last Change:          12/14/2018 15:42:54.
#include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <list>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;

void LoopUntilZeroInpput() {
  int hogegegege = 0;
  while (cin >> hogegegege && hogegegege != 0) {
  }
}

struct Wind {
  int dir;
  string dirSixteen;
  int power;
};

int CalWindSpeed(int input) {
  input = input * 10;
  int speed = input / 6;
  int ans = 0;
  if (speed < 25) {
    ans = 0;
  } else if (25 <= speed && speed < 155) {
    ans = 1;
  } else if (155 <= speed && speed < 335) {
    ans = 2;
  } else if (335 <= speed && speed < 545) {
    ans = 3;
  } else if (545 <= speed && speed < 795) {
    ans = 4;
  } else if (795 <= speed && speed < 1075) {
    ans = 5;
  } else if (1075 <= speed && speed < 1385) {
    ans = 6;
  } else if (1385 <= speed && speed < 1715) {
    ans = 7;
  } else if (1715 <= speed && speed < 2075) {
    ans = 8;
  } else if (2075 <= speed && speed < 2445) {
    ans = 9;
  } else if (2445 <= speed && speed < 2845) {
    ans = 10;
  } else if (2845 <= speed && speed < 2365) {
    ans = 11;
  } else if (3265 <= speed) {
    ans = 12;
  }
  return ans;
}

string CalWindDir(int input) {
  string ans;
  if (113 <= input && input < 338) {
    ans = "NNE";
  } else if (338 <= input && input < 563) {
    ans = "NE";
  } else if (563 <= input && input < 788) {
    ans = "ENE";
  } else if (788 <= input && input < 1013) {
    ans = "E";
  } else if (1013 <= input && input < 1238) {
    ans = "ESE";
  } else if (1238 <= input && input < 1463) {
    ans = "SE";
  } else if (1463 <= input && input < 1688) {
    ans = "SSE";
  } else if (1688 <= input && input < 1913) {
    ans = "S";
  } else if (1913 <= input && input < 2138) {
    ans = "SSW";
  } else if (2138 <= input && input < 2363) {
    ans = "SW";
  } else if (2363 <= input && input < 2588) {
    ans = "WSW";
  } else if (2588 <= input && input < 2813) {
    ans = "W";
  } else if (2813 <= input && input < 3038) {
    ans = "WNW";
  } else if (3038 <= input && input < 3263) {
    ans = "NW";
  } else if (3263 <= input && input < 3488) {
    ans = "NNW";
  } else {
    ans = "N";
  }
  return ans;
}

int main() {
  Wind wind, ans;
  cin >> wind.dir >> wind.power;
  ans.power = CalWindSpeed(wind.power);
  ans.dirSixteen = CalWindDir(wind.dir);
  if (ans.power == 0) {
    ans.dirSixteen = "C";
  }
  cout << ans.dirSixteen << " " << ans.power << endl;
}

Submission Info

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

Judge Result

Set Name all
Score / Max Score 0 / 100
Status
AC × 63
WA × 3
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 1 ms 256 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 WA 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 WA 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 WA 1 ms 256 KB