Submission #230703


Source Code Expand

// 多いのはだめぽ。
#include <stdio.h>

#define MAX_INPUT 100000
#define MAX_VALUE 1000000
static int input[MAX_INPUT][2];

int main()
{
	int n;
	int i;
	int result;
	int cur;

	scanf("%d", &n);

	for( i=0; i<n; ++i )
	{
		int min, max;
		scanf("%d %d", &min, &max);
		input[i][0] = min;
		input[i][1] = max;
	}

	cur = 0;
	result = 0;
	for( i=0; i<MAX_VALUE; ++i )
	{
		int j;
		int dec = 0;
		for( j=0; j<n; ++j )
		{
			if( input[j][0] == i )
			{
				++ cur;
			}
			if( input[j][1] == i )
			{
				++ dec;
			}
		}
		if( cur > result )
		{
			result = cur;
		}
		cur -= dec;
	}

	printf("%d\n", result);
	return 0;
}

Submission Info

Submission Time
Task C - AtColor
User hio
Language C (GCC 4.6.4)
Score 0
Code Size 681 Byte
Status WA
Exec Time 3036 ms
Memory 1580 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:15:7: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:20:8: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 1
WA × 1
AC × 3
WA × 1
TLE × 13
AC × 3
WA × 1
TLE × 38
Set Name Test Cases
Sample subtask0_sample01.txt, subtask0_sample02.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask0_sample01.txt, subtask0_sample02.txt
Subtask2 subtask0_sample01.txt, subtask0_sample02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt
Case Name Status Exec Time Memory
subtask0_sample01.txt AC 39 ms 796 KB
subtask0_sample02.txt WA 40 ms 624 KB
subtask1_01.txt AC 27 ms 800 KB
subtask1_02.txt AC 31 ms 672 KB
subtask1_03.txt TLE 3033 ms 804 KB
subtask1_04.txt TLE 3031 ms 812 KB
subtask1_05.txt TLE 3030 ms 804 KB
subtask1_06.txt TLE 3030 ms 800 KB
subtask1_07.txt TLE 3032 ms 808 KB
subtask1_08.txt TLE 3030 ms 796 KB
subtask1_09.txt TLE 3032 ms 800 KB
subtask1_10.txt TLE 3032 ms 804 KB
subtask1_11.txt TLE 3030 ms 804 KB
subtask1_12.txt TLE 3030 ms 808 KB
subtask1_13.txt TLE 3030 ms 812 KB
subtask1_14.txt TLE 3031 ms 856 KB
subtask1_15.txt TLE 3030 ms 788 KB
subtask2_01.txt TLE 3032 ms 1572 KB
subtask2_02.txt TLE 3032 ms 1576 KB
subtask2_03.txt TLE 3031 ms 1576 KB
subtask2_04.txt TLE 3033 ms 1524 KB
subtask2_05.txt TLE 3032 ms 1572 KB
subtask2_06.txt TLE 3032 ms 1564 KB
subtask2_07.txt TLE 3031 ms 1572 KB
subtask2_08.txt TLE 3030 ms 1500 KB
subtask2_09.txt TLE 3030 ms 1504 KB
subtask2_10.txt TLE 3029 ms 1576 KB
subtask2_11.txt TLE 3030 ms 1520 KB
subtask2_12.txt TLE 3031 ms 1576 KB
subtask2_13.txt TLE 3036 ms 1492 KB
subtask2_14.txt TLE 3032 ms 1572 KB
subtask2_15.txt TLE 3031 ms 1572 KB
subtask2_16.txt TLE 3032 ms 1572 KB
subtask2_17.txt TLE 3030 ms 1572 KB
subtask2_18.txt TLE 3031 ms 1580 KB
subtask2_19.txt TLE 3031 ms 1576 KB
subtask2_20.txt TLE 3032 ms 1564 KB
subtask2_21.txt TLE 3030 ms 1576 KB
subtask2_22.txt TLE 3031 ms 1576 KB
subtask2_23.txt TLE 3031 ms 1572 KB
subtask2_24.txt TLE 3030 ms 1568 KB
subtask2_25.txt TLE 3031 ms 1524 KB