Submission #3268058


Source Code Expand

#include<stdio.h>
int main(){
	int n,i,j,ans=0,count;
	scanf("%d",&n);
	int a[n],b[n];
	for(i=0;i<n;i++){
		scanf("%d %d",&a[i],&b[i]);
	}
	
	for(j=0;j<=1000000;j++){
		count=0;
		for(i=0;i<n;i++){
			if(a[i]<=j&&j<=b[i]) count++;
		}
		if(ans<count) ans=count;
	}
	printf("%d\n",ans);
}

Submission Info

Submission Time
Task C - AtColor
User feather256
Language C (GCC 5.4.1)
Score 30
Code Size 304 Byte
Status TLE
Exec Time 3155 ms
Memory 896 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:4:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ^
./Main.c:7:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&a[i],&b[i]);
   ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 2
AC × 17
AC × 17
TLE × 25
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 4 ms 128 KB
subtask0_sample02.txt AC 4 ms 128 KB
subtask1_01.txt AC 2 ms 128 KB
subtask1_02.txt AC 3 ms 128 KB
subtask1_03.txt AC 1941 ms 128 KB
subtask1_04.txt AC 1941 ms 128 KB
subtask1_05.txt AC 1940 ms 128 KB
subtask1_06.txt AC 1940 ms 128 KB
subtask1_07.txt AC 1940 ms 128 KB
subtask1_08.txt AC 2473 ms 128 KB
subtask1_09.txt AC 2452 ms 128 KB
subtask1_10.txt AC 2506 ms 128 KB
subtask1_11.txt AC 2496 ms 128 KB
subtask1_12.txt AC 2464 ms 128 KB
subtask1_13.txt AC 2438 ms 128 KB
subtask1_14.txt AC 2486 ms 128 KB
subtask1_15.txt AC 2501 ms 128 KB
subtask2_01.txt TLE 3155 ms 896 KB
subtask2_02.txt TLE 3155 ms 896 KB
subtask2_03.txt TLE 3155 ms 896 KB
subtask2_04.txt TLE 3155 ms 896 KB
subtask2_05.txt TLE 3155 ms 896 KB
subtask2_06.txt TLE 3155 ms 896 KB
subtask2_07.txt TLE 3155 ms 896 KB
subtask2_08.txt TLE 3155 ms 896 KB
subtask2_09.txt TLE 3155 ms 896 KB
subtask2_10.txt TLE 3155 ms 896 KB
subtask2_11.txt TLE 3155 ms 896 KB
subtask2_12.txt TLE 3155 ms 896 KB
subtask2_13.txt TLE 3155 ms 896 KB
subtask2_14.txt TLE 3155 ms 896 KB
subtask2_15.txt TLE 3155 ms 896 KB
subtask2_16.txt TLE 3155 ms 896 KB
subtask2_17.txt TLE 3155 ms 896 KB
subtask2_18.txt TLE 3155 ms 896 KB
subtask2_19.txt TLE 3155 ms 896 KB
subtask2_20.txt TLE 3155 ms 896 KB
subtask2_21.txt TLE 3155 ms 896 KB
subtask2_22.txt TLE 3155 ms 896 KB
subtask2_23.txt TLE 3155 ms 896 KB
subtask2_24.txt TLE 3155 ms 896 KB
subtask2_25.txt TLE 3155 ms 896 KB