Submission #259800


Source Code Expand

#include <stdio.h>

int main() {
	int N, i, j, changeS, changeE;
	int S[30000], E[30000];
	scanf("%d", &N);
//	N = 2360;
	for(i = 0; i < N; i++){
		scanf("%d-%d", &S[i], &E[i]);
//		S[i] =  i;
//		E[i] =  i;
		if((S[i] % 10) < 5){
			S[i] = (S[i] / 10) * 10;
		}else{
			S[i] = (S[i] / 10) * 10 + 5;
		}
		if((E[i] % 10) == 0){
			E[i] = (E[i] / 10) * 10;
		}else if((E[i] % 10) <= 5){
			E[i] = (E[i] / 10) * 10 + 5;
		}else{
			E[i] = (E[i] / 10) * 10 + 10;
		}
		if(S[i] % 100 == 60){
			S[i] = S[i] - 60 + 100;
		}
		if(E[i] % 100 == 60){
			E[i] = E[i] - 60 + 100;
		}
//		printf("%04d-%04d-%04d\n", i, S[i], E[i]);
	}
//	printf(" \n");
	for(i = 0; i < N; i++){
		for(j = i + 1; j < N; j++){
			if(S[i] > S[j]){
				changeS = S[i];
				S[i] = S[j];
				S[j] = changeS;
				changeE = E[i];
				E[i] = E[j];
				E[j] = changeE;
			}
		}
//	printf("%04d-%04d\n", S[i], E[i]);
	}
//	printf(" \n");
	//絶対条件 S[i] < S[i-1]
	for(i = 0; i < N; i++){
		for(j = i + 1; j < N; j++){
			if(E[i] >= S[j]){
				if(E[i] < E[j]){
					E[i] = E[j];
				}else{
					E[j] = E[i];
				}
			}
		}
//	printf("%04d-%04d\n", S[i], E[i]);
	}
//	printf(" \n");
	printf("%04d-%04d\n", S[0], E[0]);
	for(i = 1; i < N; i++){
		if(E[i] > E[i - 1]){
			printf("%04d-%04d\n", S[i], E[i]);
		}
	}
	return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User ne260120
Language C (GCC 4.6.4)
Score 100
Code Size 1355 Byte
Status AC
Exec Time 1708 ms
Memory 1008 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:6:7: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:9:8: warning: ignoring return value of ‘scanf’, 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 21 ms 796 KB
00_sample_02.txt AC 21 ms 728 KB
00_sample_03.txt AC 21 ms 796 KB
cho_cho_chokudai.txt AC 1513 ms 996 KB
chokudai_ga_cho.txt AC 1620 ms 996 KB
test_01.txt AC 22 ms 776 KB
test_02.txt AC 21 ms 796 KB
test_03.txt AC 23 ms 800 KB
test_04.txt AC 23 ms 800 KB
test_05.txt AC 23 ms 716 KB
test_06.txt AC 24 ms 764 KB
test_07.txt AC 23 ms 800 KB
test_08.txt AC 28 ms 764 KB
test_09.txt AC 38 ms 764 KB
test_10.txt AC 32 ms 764 KB
test_11.txt AC 28 ms 796 KB
test_12.txt AC 23 ms 800 KB
test_13.txt AC 31 ms 764 KB
test_14.txt AC 37 ms 820 KB
test_15.txt AC 29 ms 760 KB
test_16.txt AC 31 ms 764 KB
test_17.txt AC 46 ms 764 KB
test_18.txt AC 24 ms 804 KB
test_19.txt AC 25 ms 756 KB
test_20.txt AC 31 ms 760 KB
test_21.txt AC 1629 ms 928 KB
test_22.txt AC 1561 ms 1000 KB
test_23.txt AC 1708 ms 940 KB
test_24.txt AC 1582 ms 936 KB
test_25.txt AC 1578 ms 1008 KB
test_26.txt AC 1633 ms 936 KB
test_27.txt AC 1544 ms 936 KB
test_28.txt AC 1176 ms 936 KB
test_29.txt AC 22 ms 748 KB
test_30.txt AC 29 ms 760 KB
test_31.txt AC 58 ms 804 KB
test_32.txt AC 22 ms 804 KB
test_33.txt AC 554 ms 876 KB
test_34.txt AC 26 ms 760 KB
test_35.txt AC 24 ms 772 KB
test_36.txt AC 1583 ms 1008 KB
test_37.txt AC 1190 ms 936 KB
test_38.txt AC 1583 ms 940 KB
test_39.txt AC 1206 ms 940 KB
test_40.txt AC 1203 ms 1004 KB
test_41.txt AC 1525 ms 900 KB
test_42.txt AC 1559 ms 988 KB
test_43.txt AC 1559 ms 1000 KB