Submission #710765


Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<iomanip>
#include<algorithm>

typedef struct rain {
	// 雨の降り始めと終わりを記録
	int start, end;
}RAIN;

void update(std::vector<RAIN> &v, int rain_start, int rain_end) {
	for (size_t i = 0; i < v.size(); ++i) {
		int s = v[i].start;
		int e = v[i].end;

		// 更新の必要なし
		if (s <= rain_start && rain_end <= e) return;

		/*if (s <= rain_end && rain_end <= e && rain_start <= s) {
			v[i].start = rain_start;
			return;
		}
		*/
		if (s <= rain_start && rain_start <= e && e <= rain_end) {
			v[i].end = rain_end;
			return;
		}
	}
	RAIN r;
	r.start = rain_start;
	r.end = rain_end;
	v.push_back(r);
}

std::vector<std::string> input(int n) {
	std::vector<std::string> time(n);
	for (int i = 0; i < n; ++i) {
		std::cin >> time[i];
	}
	
	return time;
}

int main() {
	int n;

	std::cin >> n;

	std::vector<std::string> times = input(n);

	std::sort(times.begin(), times.end());


	std::vector<RAIN> v;
	for (int i = 0; i < n; ++i) {
		int s = std::stoi(times[i].substr(0, 4));
		int e = std::stoi(times[i].substr(5, 4));
		s = (s % 100 / 5) + (s / 100 * 12);
		e = ((e + 4) % 100 / 5) + (e / 100 * 12);
		update(v, s, e);
	}

	for (RAIN r : v) {
		int s = (r.start / 12 * 100) + (r.start % 12 * 5);
		int e = (r.end / 12 * 100) + (r.end % 12 * 5);
		std::cout << std::setw(4) << std::setfill('0') << s << "-" \
			<< std::setw(4) << std::setfill('0') << e << std::endl;
	}
	return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User Kampachi
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1544 Byte
Status AC
Exec Time 96 ms
Memory 3100 KB

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 27 ms 824 KB
00_sample_02.txt AC 29 ms 924 KB
00_sample_03.txt AC 26 ms 932 KB
cho_cho_chokudai.txt AC 83 ms 3008 KB
chokudai_ga_cho.txt AC 96 ms 3008 KB
test_01.txt AC 26 ms 924 KB
test_02.txt AC 28 ms 932 KB
test_03.txt AC 28 ms 936 KB
test_04.txt AC 28 ms 924 KB
test_05.txt AC 29 ms 928 KB
test_06.txt AC 27 ms 960 KB
test_07.txt AC 27 ms 928 KB
test_08.txt AC 26 ms 928 KB
test_09.txt AC 27 ms 956 KB
test_10.txt AC 28 ms 956 KB
test_11.txt AC 28 ms 1052 KB
test_12.txt AC 30 ms 1052 KB
test_13.txt AC 27 ms 932 KB
test_14.txt AC 25 ms 960 KB
test_15.txt AC 28 ms 960 KB
test_16.txt AC 27 ms 924 KB
test_17.txt AC 26 ms 956 KB
test_18.txt AC 28 ms 924 KB
test_19.txt AC 27 ms 964 KB
test_20.txt AC 28 ms 1056 KB
test_21.txt AC 91 ms 3008 KB
test_22.txt AC 91 ms 3004 KB
test_23.txt AC 91 ms 3008 KB
test_24.txt AC 91 ms 3008 KB
test_25.txt AC 93 ms 2972 KB
test_26.txt AC 89 ms 3004 KB
test_27.txt AC 83 ms 3008 KB
test_28.txt AC 91 ms 3004 KB
test_29.txt AC 27 ms 928 KB
test_30.txt AC 27 ms 928 KB
test_31.txt AC 36 ms 1216 KB
test_32.txt AC 27 ms 936 KB
test_33.txt AC 67 ms 2228 KB
test_34.txt AC 27 ms 916 KB
test_35.txt AC 28 ms 932 KB
test_36.txt AC 91 ms 2976 KB
test_37.txt AC 91 ms 3000 KB
test_38.txt AC 88 ms 3004 KB
test_39.txt AC 91 ms 3004 KB
test_40.txt AC 90 ms 3008 KB
test_41.txt AC 90 ms 3100 KB
test_42.txt AC 90 ms 2996 KB
test_43.txt AC 96 ms 3004 KB