Submission #157924


Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

int arrangeTime( int n, bool up ){
	if(	0 < n%10 && n%10 < 5 ){
		if( up ){
			n = n/10*10+5;
		}else{
			n = n/10*10;
		}
	}else if( 5 < n%10 ){
		if( up ){
			n = (n/10+1)*10;
		}else{
			n = n/10*10+5;
		}
	}
	if( n%100 == 60 ) n = (n/100+1)*100;
	return n;
}
		
int main(){
	int n;
	cin >> n;
	vector<int> s(n), e(n);
	for( int i=0; i<n; i++ ){
		scanf("%d-%d", &s[i], &e[i]);
		s[i] = arrangeTime(s[i],false);
		e[i] = arrangeTime(e[i],true);
	}
	sort(s.begin(), s.end());
	sort(e.begin(), e.end());
	//for( int i=0; i<n; i++ ) cout << s[i] << "-" << e[i] << endl;
	printf("%04d", s[0]);
	for( int i=1; i<n; i++ ){
		if( e[i-1] < s[i] ) printf("%04d", s[i]);
		if( i < n-1 && e[i] < s[i+1] ) printf("-%04d\n", e[i]);
	}
	printf("-%04d\n", e[n-1]);
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User shuhei23
Language C++ (G++ 4.6.4)
Score 0
Code Size 895 Byte
Status WA
Exec Time 140 ms
Memory 1584 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:30:31: 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 0 / 100
Status
AC × 40
WA × 8
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 140 ms 1204 KB
00_sample_02.txt AC 31 ms 1204 KB
00_sample_03.txt AC 30 ms 1180 KB
cho_cho_chokudai.txt AC 44 ms 1456 KB
chokudai_ga_cho.txt AC 48 ms 1456 KB
test_01.txt WA 31 ms 1168 KB
test_02.txt WA 31 ms 1328 KB
test_03.txt WA 31 ms 1220 KB
test_04.txt WA 36 ms 1208 KB
test_05.txt WA 32 ms 1208 KB
test_06.txt AC 34 ms 1212 KB
test_07.txt AC 33 ms 1172 KB
test_08.txt AC 34 ms 1196 KB
test_09.txt AC 33 ms 1196 KB
test_10.txt AC 31 ms 1204 KB
test_11.txt AC 34 ms 1328 KB
test_12.txt AC 30 ms 1204 KB
test_13.txt AC 31 ms 1196 KB
test_14.txt AC 32 ms 1296 KB
test_15.txt AC 33 ms 1292 KB
test_16.txt WA 32 ms 1208 KB
test_17.txt AC 32 ms 1204 KB
test_18.txt AC 32 ms 1200 KB
test_19.txt AC 31 ms 1328 KB
test_20.txt AC 32 ms 1208 KB
test_21.txt AC 46 ms 1460 KB
test_22.txt AC 47 ms 1460 KB
test_23.txt AC 55 ms 1456 KB
test_24.txt AC 45 ms 1584 KB
test_25.txt AC 45 ms 1460 KB
test_26.txt AC 46 ms 1468 KB
test_27.txt AC 43 ms 1452 KB
test_28.txt AC 46 ms 1460 KB
test_29.txt AC 31 ms 1288 KB
test_30.txt AC 32 ms 1172 KB
test_31.txt AC 35 ms 1332 KB
test_32.txt WA 30 ms 1172 KB
test_33.txt AC 40 ms 1464 KB
test_34.txt WA 31 ms 1196 KB
test_35.txt AC 31 ms 1172 KB
test_36.txt AC 47 ms 1452 KB
test_37.txt AC 49 ms 1452 KB
test_38.txt AC 46 ms 1584 KB
test_39.txt AC 45 ms 1428 KB
test_40.txt AC 47 ms 1464 KB
test_41.txt AC 50 ms 1452 KB
test_42.txt AC 46 ms 1580 KB
test_43.txt AC 46 ms 1456 KB