Submission #2668516


Source Code Expand

#include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;

static void print_time(int32_t start, int32_t end) {
	int32_t start_hour = start / 60;
	int32_t start_min = start - start_hour * 60;
	int32_t end_hour = end / 60;
	int32_t end_min = end - end_hour * 60;
	printf("%02d%02d-%02d%02d\n", start_hour, start_min, end_hour, end_min);
}

int main()
{
	int32_t N;
	scanf("%d", &N);

	vector<int32_t> rain(1442);
	std::fill(std::begin(rain), std::end(rain), 0);
	for (int32_t n = 0; n < N; n++) {
		int32_t S, E;
		scanf("%d-%d", &S, &E);

		int32_t hour, _min;
		hour = S / 100;
		_min = hour * 60 + S - (hour * 100);
		if (_min % 5 != 0)
			_min -= _min % 5;
		rain[_min]++;

		hour = E / 100;
		_min = hour * 60 + E - (hour * 100);
		if (_min % 5 != 0)
			_min += 5 - (_min % 5);
		rain[_min + 1]--;
	}

	for (size_t i = 1; i < rain.size(); i++)
		rain[i] += rain[i - 1];
	rain[1441] = 0; // sentinel

	int32_t start = -1;
	for (size_t i = 0; i < rain.size(); i++) {
		if (rain[i] > 0) {
			if (start == -1)
				start = i;
		} else {
			if (start != -1) {
				print_time(start, i - 1);
				start = -1;
			}
		}
	}
	return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User masap
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1261 Byte
Status AC
Exec Time 7 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:20:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:26:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d-%d", &S, &E);
                         ^

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 48
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, cho_cho_chokudai.txt, chokudai_ga_cho.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
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
cho_cho_chokudai.txt AC 6 ms 256 KB
chokudai_ga_cho.txt AC 6 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 6 ms 256 KB
test_22.txt AC 6 ms 256 KB
test_23.txt AC 6 ms 256 KB
test_24.txt AC 6 ms 256 KB
test_25.txt AC 6 ms 256 KB
test_26.txt AC 6 ms 256 KB
test_27.txt AC 7 ms 384 KB
test_28.txt AC 6 ms 256 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 2 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 4 ms 256 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 6 ms 256 KB
test_37.txt AC 6 ms 256 KB
test_38.txt AC 7 ms 256 KB
test_39.txt AC 6 ms 256 KB
test_40.txt AC 6 ms 256 KB
test_41.txt AC 6 ms 256 KB
test_42.txt AC 6 ms 256 KB
test_43.txt AC 6 ms 256 KB