Submission #515353


Source Code Expand

#include <bits/stdc++.h>

#define INF INT_MAX/3
#define ll long long

using namespace std;

int mintue[1440];

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

	int minstart = INF, maxend = 0;
	for (int i = 0;i < n;i++){
		int a, b, c, d;
		scanf("%2d%2d-%2d%2d",&a,&b,&c,&d);

		//開始
		a = a * 60;
		b = b - b % 5;
		int start = a + b;

		//開始
		c = c * 60;
		d = d + (5 -(d % 5)) % 5;
		int end = c + d;

		//cout << b << " " << d << endl;

		for (int i = start;i <= end;i++){
			mintue[i] = 1;
		}

		if (minstart > start){
			minstart = start;
		}
		if (maxend < end){
			maxend = end;
		}
		
	}

	//cout << minstart << " " << maxend << endl;

	bool flag = false;
	for (int i = minstart;i <= maxend + 1;i++){
		if (!flag && mintue[i] == 1){
			if (i % 60 >= 10 && i / 60 >= 10)
				cout << i / 60 << i % 60 << "-";
			else if (i % 60 >= 10 && i / 60 < 10)
				cout << 0 << i / 60 << i % 60 << "-";
			else if (i % 60 < 10 && i / 60 >= 10)
				cout << i / 60 << 0 << i % 60 << "-";
			else
				cout << 0 << i / 60 << 0 <<i % 60 << "-";

			flag = true;
		}

		if (flag && mintue[i] == 0){
			if ((i - 1) % 60 >= 10 && (i - 1)/60 >= 10)
				cout << (i - 1) / 60 << (i - 1) % 60 << endl;
			else if ((i - 1) % 60 >= 10 && (i - 1)/60 < 10)
				cout << 0 << (i - 1) / 60 << (i - 1) % 60 << endl;
			else if ((i - 1) % 60 < 10 && (i - 1)/60 >= 10)
				cout << (i - 1) / 60 << 0 << (i - 1) % 60 << endl;
			else
				cout << 0 << (i - 1) / 60 << 0 << (i - 1) % 60 << endl;

			flag = false;
		}
	}

	return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User mkjiro
Language C++ (G++ 4.6.4)
Score 100
Code Size 1573 Byte
Status AC
Exec Time 85 ms
Memory 928 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:17:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

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 26 ms 800 KB
00_sample_02.txt AC 25 ms 924 KB
00_sample_03.txt AC 24 ms 796 KB
cho_cho_chokudai.txt AC 85 ms 800 KB
chokudai_ga_cho.txt AC 53 ms 876 KB
test_01.txt AC 25 ms 744 KB
test_02.txt AC 26 ms 924 KB
test_03.txt AC 25 ms 804 KB
test_04.txt AC 26 ms 924 KB
test_05.txt AC 26 ms 796 KB
test_06.txt AC 28 ms 876 KB
test_07.txt AC 30 ms 876 KB
test_08.txt AC 26 ms 804 KB
test_09.txt AC 36 ms 812 KB
test_10.txt AC 30 ms 796 KB
test_11.txt AC 28 ms 800 KB
test_12.txt AC 25 ms 924 KB
test_13.txt AC 33 ms 804 KB
test_14.txt AC 26 ms 800 KB
test_15.txt AC 26 ms 928 KB
test_16.txt AC 25 ms 804 KB
test_17.txt AC 28 ms 872 KB
test_18.txt AC 32 ms 876 KB
test_19.txt AC 25 ms 928 KB
test_20.txt AC 26 ms 924 KB
test_21.txt AC 44 ms 876 KB
test_22.txt AC 52 ms 860 KB
test_23.txt AC 46 ms 804 KB
test_24.txt AC 45 ms 924 KB
test_25.txt AC 43 ms 800 KB
test_26.txt AC 37 ms 804 KB
test_27.txt AC 38 ms 800 KB
test_28.txt AC 37 ms 920 KB
test_29.txt AC 25 ms 804 KB
test_30.txt AC 23 ms 796 KB
test_31.txt AC 27 ms 924 KB
test_32.txt AC 24 ms 928 KB
test_33.txt AC 33 ms 800 KB
test_34.txt AC 30 ms 804 KB
test_35.txt AC 26 ms 928 KB
test_36.txt AC 50 ms 800 KB
test_37.txt AC 37 ms 924 KB
test_38.txt AC 38 ms 868 KB
test_39.txt AC 37 ms 872 KB
test_40.txt AC 38 ms 804 KB
test_41.txt AC 60 ms 868 KB
test_42.txt AC 62 ms 796 KB
test_43.txt AC 62 ms 796 KB