Submission #146675


Source Code Expand

#include <stdio.h>
#include <stdlib.h>

void sort(int *s, int *idx, int n) {
	int min, tmp;
	int i, j;

	for( i = 0; i < n - 1; i++ ) {
		min = i;
		for( j = i + 1; j < n; j++ ) {
			if( s[idx[min]] > s[idx[j]] ) min = j;
		}
		tmp = idx[min];
		idx[min] = idx[i];
		idx[i] = tmp;
	}

	return;
}

int main(void) {
	int *s, *e, *idx;
	int n;
	int i, c;

	scanf("%d", &n);
	s = (int *)malloc(sizeof(int) * n);
	e = (int *)malloc(sizeof(int) * n);
	idx = (int *)malloc(sizeof(int) * n);
	if( s == NULL || e == NULL || idx == NULL ) exit(EXIT_FAILURE);
	for( i = 0; i < n; i++ ) {
		scanf("%d-%d", s + i, e + i);
		s[i] = s[i] % 10 >= 5 ? s[i] - (s[i] % 10 - 5) : s[i] - s[i] % 10;
		e[i] = e[i] % 10 >= 5 ? e[i] + (10 - (e[i] % 10)) % 5 : e[i] + (5 - (e[i] % 10)) % 5;
		e[i] += (e[i] / 10) % 10 == 6 ? 40 : 0;
		idx[i] = i;
	}
	sort(s, idx, n);

	c = 0;
	for( i = 1; i < n; i++ ) {
		if( s[idx[i]] <= e[idx[c]] ) {
			if( e[idx[c]] <= e[idx[i]] ) {
				e[idx[c]] = e[idx[i]];
			}
			s[idx[i]] = -1;	// C言語めんどう
		} else {
			c = i;
		}
	}
	for( i = 0; i < n; i++ ) {
		if( s[idx[i]] != -1 ) printf("%04d-%04d\n", s[idx[i]], e[idx[i]]);
	}

	return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User maple0705
Language C (GCC 4.6.4)
Score 100
Code Size 1217 Byte
Status AC
Exec Time 880 ms
Memory 1332 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:26:7: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:32: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 55 ms 908 KB
00_sample_02.txt AC 28 ms 932 KB
00_sample_03.txt AC 27 ms 1008 KB
cho_cho_chokudai.txt AC 827 ms 1260 KB
chokudai_ga_cho.txt AC 849 ms 1268 KB
test_01.txt AC 28 ms 936 KB
test_02.txt AC 26 ms 880 KB
test_03.txt AC 27 ms 916 KB
test_04.txt AC 25 ms 908 KB
test_05.txt AC 26 ms 908 KB
test_06.txt AC 27 ms 960 KB
test_07.txt AC 26 ms 912 KB
test_08.txt AC 40 ms 908 KB
test_09.txt AC 25 ms 932 KB
test_10.txt AC 27 ms 920 KB
test_11.txt AC 26 ms 928 KB
test_12.txt AC 26 ms 916 KB
test_13.txt AC 26 ms 912 KB
test_14.txt AC 26 ms 916 KB
test_15.txt AC 25 ms 920 KB
test_16.txt AC 26 ms 932 KB
test_17.txt AC 25 ms 912 KB
test_18.txt AC 26 ms 916 KB
test_19.txt AC 26 ms 928 KB
test_20.txt AC 26 ms 916 KB
test_21.txt AC 880 ms 1256 KB
test_22.txt AC 866 ms 1256 KB
test_23.txt AC 874 ms 1288 KB
test_24.txt AC 869 ms 1296 KB
test_25.txt AC 862 ms 1288 KB
test_26.txt AC 863 ms 1292 KB
test_27.txt AC 841 ms 1292 KB
test_28.txt AC 863 ms 1280 KB
test_29.txt AC 28 ms 920 KB
test_30.txt AC 26 ms 936 KB
test_31.txt AC 46 ms 964 KB
test_32.txt AC 25 ms 912 KB
test_33.txt AC 386 ms 1172 KB
test_34.txt AC 24 ms 916 KB
test_35.txt AC 25 ms 1000 KB
test_36.txt AC 860 ms 1268 KB
test_37.txt AC 862 ms 1288 KB
test_38.txt AC 864 ms 1296 KB
test_39.txt AC 866 ms 1216 KB
test_40.txt AC 866 ms 1292 KB
test_41.txt AC 834 ms 1332 KB
test_42.txt AC 864 ms 1288 KB
test_43.txt AC 846 ms 1292 KB