Submission #1399235


Source Code Expand

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
using namespace std;
int value_round(int value, bool flag);

int main(){
	int N = 0;
	cin >> N;
	int* S = new int[N];
	int* E = new int[N];
	string line;
	for (int i = 0; i < N; i++) {
		cin >> line;
		S[i] = atoi((line.substr(0, 4)).c_str());
		E[i] = atoi((line.substr(5, 4)).c_str());
		S[i] = value_round(S[i],true);
		E[i] = value_round(E[i],false);
	}

	int temp = 0;
	for (int i = 0; i < N; i++) {
		for (int j = i; j < N; j++) {
			if (S[i] > S[j]) {
				temp = S[i];
				S[i] = S[j];
				S[j] = temp;
				temp = E[i];
				E[i] = E[j];
				E[j] = temp;
			}
		}
	}

	temp = E[0];
	cout << setfill('0') << setw(4) << S[0];
	for (int i = 0; i < N - 1; i++) {
		if (E[i] > temp) {
			temp = E[i];
		}

		if (temp < S[i + 1]) {
			cout << "-" << setfill('0') << setw(4) << temp << endl;
			cout << setfill('0') << setw(4) << S[i + 1];
		}
	}
	cout << "-" << setfill('0') << setw(4) << max(temp,E[N-1]) << endl;

	return 0;
}

int value_round(int value, bool flag) {
	if (value % 5 != 0) {
		if (flag == true) {
			value = value - value % 5;
		}
		else {
			value = value - value % 5 + 5;
		}
	}
	
	if (value % 100 == 60) {
		value = value - 60 + 100;
	}

	return value;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User yapoo
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1320 Byte
Status AC
Exec Time 416 ms
Memory 512 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 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 312 ms 512 KB
chokudai_ga_cho.txt AC 416 ms 512 KB
test_01.txt AC 1 ms 256 KB
test_02.txt AC 1 ms 256 KB
test_03.txt AC 2 ms 256 KB
test_04.txt AC 1 ms 256 KB
test_05.txt AC 2 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 2 ms 256 KB
test_10.txt AC 2 ms 256 KB
test_11.txt AC 2 ms 256 KB
test_12.txt AC 2 ms 256 KB
test_13.txt AC 1 ms 256 KB
test_14.txt AC 2 ms 256 KB
test_15.txt AC 2 ms 256 KB
test_16.txt AC 1 ms 256 KB
test_17.txt AC 2 ms 256 KB
test_18.txt AC 1 ms 256 KB
test_19.txt AC 2 ms 256 KB
test_20.txt AC 2 ms 256 KB
test_21.txt AC 380 ms 512 KB
test_22.txt AC 363 ms 512 KB
test_23.txt AC 377 ms 512 KB
test_24.txt AC 364 ms 512 KB
test_25.txt AC 372 ms 512 KB
test_26.txt AC 385 ms 512 KB
test_27.txt AC 312 ms 512 KB
test_28.txt AC 351 ms 512 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 17 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 181 ms 384 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 377 ms 512 KB
test_37.txt AC 363 ms 512 KB
test_38.txt AC 385 ms 512 KB
test_39.txt AC 345 ms 512 KB
test_40.txt AC 350 ms 512 KB
test_41.txt AC 312 ms 512 KB
test_42.txt AC 350 ms 512 KB
test_43.txt AC 352 ms 512 KB