Submission #1215290


Source Code Expand

#include <cstdio>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <stack>
#include <vector>
#include <algorithm>
#include <set>
#include <deque>
#include <utility>
#include <chrono>
#include <sstream>
#include <iomanip>

#define INF 1 << 30
#define MOD 1000000007;
#define PI 3.14159265358979
#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)
#define reu(i, l, r) for (int (i) = (int)(l); (i) < (int)(r); (i)++)
#define D(x) cout << x << endl
#define d(x) cout << x
#define all(x) (x).begin(), (x).end()
#define pub(x) push_back(x)
#define pob() pop_back()
#define puf(x) push_front(x)
#define pof() pop_front()
#define mp(x, y) make_pair((x), (y))
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
template<typename T, typename U> inline void amin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if (x < y) x = y; }

static const int dx[] = {0, 0, 1, -1};
static const int dy[] = {-1, 1, 0, 0};

int main() { 

  double deg;
  double dis;
  int disint;
  string dir[] = {
    "N", "NNE", "NE", "ENE", "E", "ESE", "SE",
    "SSE", "S", "SSW", "SW", "WSW", "W", "WNW",
    "NW", "NNW", "C"
  };

  scanf("%lf %lf", &deg, &dis);
  dis = ((double)(int)((10.0 * dis / 60.0) + 0.5)) / 10.0;
  if (0.0 <= dis && dis <= 0.2)
    disint = 0;
  if (0.3 <= dis && dis <= 1.5)
    disint = 1;
  if (1.6 <= dis && dis <= 3.3)
    disint = 2;
  if (3.4 <= dis && dis <= 5.4)
    disint = 3;
  if (5.5 <= dis && dis <= 7.9)
    disint = 4;
  if (8.0 <= dis && dis <= 10.7)
    disint = 5;
  if (10.8 <= dis && dis <= 13.8)
    disint = 6;
  if (13.9 <= dis && dis <= 17.1)
    disint = 7;
  if (17.2 <= dis && dis <= 20.7)
    disint = 8;
  if (20.8 <= dis && dis <= 24.4)
    disint = 9;
  if (24.5 <= dis && dis <= 28.4)
    disint = 10;
  if (28.5 <= dis && dis <= 32.6)
    disint = 11;
  if (32.7 <= dis)
    disint = 12;
  deg /= 10.0;
  if (disint == 0) {
    d(dir[16] << " ");
  } else {
    if ((0.0 <= deg && deg < 11.25) || (348.75 <= deg && deg <360.0))
      d(dir[0] << " ");
    if (11.25 <= deg && deg < 33.75)
      d(dir[1] << " ");
    if (33.75 <= deg && deg < 56.25)
      d(dir[2] << " ");
    if (56.25 <= deg && deg < 78.75)
      d(dir[3] << " ");
    if (78.75 <= deg && deg < 101.25)
      d(dir[4] << " ");
    if (101.25 <= deg && deg < 123.75)
      d(dir[5] << " ");
    if (123.75 <= deg && deg < 146.25)
      d(dir[6] << " ");
    if (146.25 <= deg && deg < 168.75)
      d(dir[7] << " ");
    if (168.75 <= deg && deg < 191.25)
      d(dir[8] << " ");
    if (191.25 <= deg && deg < 213.75)
      d(dir[9] << " ");
    if (213.75 <= deg && deg < 236.25)
      d(dir[10] << " ");
    if (236.25 <= deg && deg < 258.75)
      d(dir[11] << " ");
    if (258.75 <= deg && deg < 281.25)
      d(dir[12] << " ");
    if (281.25 <= deg && deg < 303.75)
      d(dir[13] << " ");
    if (303.75 <= deg && deg < 326.25)
      d(dir[14] << " ");
    if (326.25 <= deg && deg < 348.75)
      d(dir[15] << " ");
  }

  printf("%d\n", disint);

  return 0;
}

Submission Info

Submission Time
Task C - 風力観測
User KokiYmgch
Language C++14 (GCC 5.4.1)
Score 100
Code Size 3535 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:65:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lf %lf", &deg, &dis);
                               ^

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 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 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