Submission #2016451


Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <utility>
#include <functional>
#include <numeric>
#include <limits>

const long long int Z = 1000000007;
const long long int INF = 1 << 30;
int flag = 0;
const int V = 10;
struct edge { int to, cost; };
std::vector<edge>v[100];
typedef std::pair<int, int>p;

int main() {
	double a, b;
	std::cin >> a >> b;
	a /= 10;
	b /= 60;
	b *= 10;
	b +=0.5;
	b = int(b);
	b /= 10;
	int flag = 0;
	if (0 <= b&&b <= 0.2) {
		std::cout << 'C' << ' ' << 0 << std::endl;
		flag = 1;
	}
	if (flag == 0) {
		if (a < 11.25 || 348.75 <= a) {
			std::cout << 'N' << ' ';
		}
		else if (11.25 <= a&&a < 33.75) {
			std::cout << "NNE" << ' ';
		}
		else if (33.75 <= a&&a < 56.25) {
			std::cout << "NE" << ' ';
		}
		else if (56.25 <= a&&a < 78.75) {
			std::cout << "ENE" << ' ';
		}
		else if (78.75 <= a&&a < 101.25) {
			std::cout << "E" << ' ';
		}
		else if (101.25 <= a&&a < 123.75) {
			std::cout << "ESE" << ' ';
		}
		else if (123.75 <= a&&a < 146.25) {
			std::cout << "SE" << ' ';
		}
		else if (146.25 <= a&&a < 168.75) {
			std::cout << "SSE" << ' ';
		}
		else if (168.75 <= a&&a < 191.25) {
			std::cout << "S" << ' ';
		}
		else if (191.25 <= a&&a < 213.75) {
			std::cout << "SSW" << ' ';
		}
		else if (213.75 <= a&&a < 236.25) {
			std::cout << "SW" << ' ';
		}
		else if (236.25 <= a&&a < 258.75) {
			std::cout << "WSW" << ' ';
		}
		else if (258.75 <= a&&a < 281.25) {
			std::cout << "W" << ' ';
		}
		else if (281.25 <= a&&a < 303.75) {
			std::cout << "WNW" << ' ';
		}
		else if (303.75 <= a&&a < 326.25) {
			std::cout << "NW" << ' ';
		}
		else if (326.25 <= a&&a < 348.75) {
			std::cout << "NNW" << ' ';
		}
	}
	if (flag == 0) {
		if (0.3 <= b&&b <= 1.5) {
			std::cout << 1 << std::endl;
		}
		if (1.6 <= b&&b <= 3.3) {
			std::cout << 2 << std::endl;
		}
		if (3.4 <= b&&b <= 5.4) {
			std::cout << 3 << std::endl;
		}
		if (5.5 <= b&&b <= 7.9) {
			std::cout << 4 << std::endl;
		}
		if (8.0 <= b&&b <= 10.7) {
			std::cout << 5 << std::endl;
		}
		if (10.8 <= b&&b <= 13.8) {
			std::cout << 6 << std::endl;
		}
		if (13.9 <= b&&b <= 17.1) {
			std::cout << 7 << std::endl;
		}
		if (17.2 <= b&&b <= 20.7) {
			std::cout << 8 << std::endl;
		}
		if (20.8 <= b&&b <= 24.4) {
			std::cout << 9 << std::endl;
		}
		if (24.5 <= b&&b <= 28.4) {
			std::cout << 10 << std::endl;
		}
		if (28.5 <= b&&b <= 32.6) {
			std::cout << 11 << std::endl;
		}
		if (32.7<=b) {
			std::cout << 12 << std::endl;
		}
	}
	return 0;
}

Submission Info

Submission Time
Task C - 風力観測
User kakakakaneko
Language C++14 (GCC 5.4.1)
Score 100
Code Size 2705 Byte
Status AC
Exec Time 3 ms
Memory 384 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 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 3 ms 384 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 3 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