Submission #1240689


Source Code Expand

#include<iostream>
#include<vector>
#include<sstream>
#include<string>
#include<iomanip>
using namespace std;


vector<string> split(string input, char delim);


int main() {
	int N;
	string s;
	vector<int> start,end;
	vector<int> s_merge, e_merge;
	cin >> N;
	for(int i=0; i<N; i++){
		cin >> s;
		vector<string> ss = split(s, '-');
		int stmp = stoi(ss[0]);
		int etmp = stoi(ss[1]);

		if (stmp%10 <5) {
			stmp = stmp - (stmp % 10);
		}
		else {
			stmp = stmp - (stmp % 10)+5;
		}

		if(etmp % 5 != 0) {
			etmp = etmp +(5 -(etmp % 5)) ;
		}
		if (etmp % 100 == 60) {
			etmp = etmp + 40;
		}
		start.push_back(stmp);
		end.push_back(etmp);
	}
	

	for (int i = 0; i<N; i++) {
		for (int j = 0; j<i; j++) {
			if (start[i] < start[j]) {
				int tmp = start[i];
				start[i] = start[j];
				start[j] = tmp;
				tmp = end[i];
				end[i] = end[j];
				end[j] = tmp;
			}
		}
	}
	int count = 0;
	for (int k = 0; k<N; k++) {
		if (k == 0) {

			s_merge.push_back(start[0]);
			e_merge.push_back(end[0]);
		}
		else if (e_merge[count] >= start[k]) {
			if (e_merge[count] < end[k]){

				e_merge.pop_back();
				e_merge.push_back(end[k]);
			}else{

			}
		}else{
			s_merge.push_back(start[k]);
			e_merge.push_back(end[k]);
			count++;
		}
	}


	for(int i=0; i<count+1; i++){
		cout << setfill('0') << setw(4) << s_merge[i] << "-" << setfill('0') << setw(4) << e_merge[i] << endl;
	}

	return 0;
}


vector<string> split(string input, char delim) {
	istringstream stream(input);
	vector<string> result;
	string field;

	while (getline(stream, field, delim)) {
		result.push_back(field);
	}
	return result;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User hanyahonya
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1700 Byte
Status AC
Exec Time 428 ms
Memory 640 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 331 ms 640 KB
chokudai_ga_cho.txt AC 428 ms 640 KB
test_01.txt AC 2 ms 256 KB
test_02.txt AC 2 ms 256 KB
test_03.txt AC 2 ms 256 KB
test_04.txt AC 2 ms 256 KB
test_05.txt AC 2 ms 256 KB
test_06.txt AC 2 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 2 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 2 ms 256 KB
test_19.txt AC 2 ms 256 KB
test_20.txt AC 2 ms 256 KB
test_21.txt AC 400 ms 640 KB
test_22.txt AC 381 ms 640 KB
test_23.txt AC 394 ms 640 KB
test_24.txt AC 382 ms 640 KB
test_25.txt AC 390 ms 640 KB
test_26.txt AC 401 ms 640 KB
test_27.txt AC 331 ms 640 KB
test_28.txt AC 369 ms 640 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 18 ms 384 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 190 ms 640 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 2 ms 256 KB
test_36.txt AC 399 ms 640 KB
test_37.txt AC 381 ms 640 KB
test_38.txt AC 404 ms 640 KB
test_39.txt AC 364 ms 640 KB
test_40.txt AC 368 ms 640 KB
test_41.txt AC 333 ms 640 KB
test_42.txt AC 369 ms 640 KB
test_43.txt AC 374 ms 640 KB