Submission #4713308


Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stdio.h>
#include <cmath>

using namespace std;

int main(){
	
	int N;
	cin >> N;

	int start,end;
	char c;
	int state = 0;

	vector<int> time_(290,0);

	for (int i = 0; i < N; i++){
		cin >> start >> c >> end;

		if(start % 10 >= 5 )
			start = start/10*10 + 5;
		else start = start/10*10;

		if (end % 10 >= 6)	
			end = (end+5)*10/10;
		else if(end % 10 >= 1)
			end = end/10*10 +5 ;

		start = (start/100)*60 + start%100;
		end = (end/100)*60 + end%100;

		int hour = (end - start)/60;
		int min = (end - start) % 60;

		int wide = hour * 12 + min / 5; 
		int s_index = start/60 * 12 + start%60/5; 

		for (int j = s_index; j < s_index + wide; j++){
			time_[j] = 1;
		}
	}

	string h,m;

	for (int i = 0; i < 290; i++){
		if(time_[i] == 1 && state == 0 ){
			if(i/12/10 == 0)
				h = '0' + to_string(i/12);
			else h = to_string(i/12);

			if((i%12)*5/10 == 0)
				m = "0" + to_string((i%12)*5);
			else m = to_string((i%12)*5);

			cout << h << m << "-";
			state = 1;
		}

		if(time_[i] == 0 && state ==1){
			if(i/12/10 == 0)
				h = '0' + to_string(i/12);
			else h = to_string(i/12);

			if((i%12)*5/10 == 0)
				m = "0" + to_string((i%12)*5);
			else m = to_string((i%12)*5);

			cout << h << m << "\n";
			state = 0;
		}
	}

	return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User kara
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1415 Byte
Status AC
Exec Time 21 ms
Memory 256 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 21 ms 256 KB
chokudai_ga_cho.txt AC 19 ms 256 KB
test_01.txt AC 2 ms 256 KB
test_02.txt AC 1 ms 256 KB
test_03.txt AC 2 ms 256 KB
test_04.txt AC 2 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 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 18 ms 256 KB
test_22.txt AC 18 ms 256 KB
test_23.txt AC 18 ms 256 KB
test_24.txt AC 18 ms 256 KB
test_25.txt AC 18 ms 256 KB
test_26.txt AC 18 ms 256 KB
test_27.txt AC 18 ms 256 KB
test_28.txt AC 18 ms 256 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 4 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 12 ms 256 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 19 ms 256 KB
test_37.txt AC 18 ms 256 KB
test_38.txt AC 18 ms 256 KB
test_39.txt AC 18 ms 256 KB
test_40.txt AC 18 ms 256 KB
test_41.txt AC 19 ms 256 KB
test_42.txt AC 19 ms 256 KB
test_43.txt AC 19 ms 256 KB