Submission #2179555


Source Code Expand

#include<stdio.h>

int main(void){
  int n,i,a,b,counter[1000000],j,temp;
  scanf("%d",&n);
  for(i=0;i<n;i++){
    counter[i] = 0;
  }
  for(i=0;i<n;i++){
    scanf("%d %d",&a,&b);
    for(j=a;j<=b;j++){
      counter[j]++;
    }
  }
  temp = n;
  while(temp >= 0){
    for(i=0;i<1000000;i++){
      if(counter[i] == temp){
	printf("%d\n",temp);
	return 0;
      }
    }
    temp--;
  }
}

Submission Info

Submission Time
Task C - AtColor
User rec
Language C (GCC 5.4.1)
Score 0
Code Size 413 Byte
Status WA
Exec Time 3155 ms
Memory 4096 KB

Compile Error

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

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 1
WA × 1
AC × 15
WA × 2
AC × 15
WA × 2
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 WA 2 ms 128 KB
subtask0_sample02.txt AC 4 ms 4096 KB
subtask1_01.txt AC 1 ms 2176 KB
subtask1_02.txt AC 1 ms 128 KB
subtask1_03.txt AC 1398 ms 4096 KB
subtask1_04.txt AC 1396 ms 4096 KB
subtask1_05.txt AC 1396 ms 4096 KB
subtask1_06.txt AC 1406 ms 4096 KB
subtask1_07.txt WA 758 ms 128 KB
subtask1_08.txt AC 1112 ms 4096 KB
subtask1_09.txt AC 1104 ms 4096 KB
subtask1_10.txt AC 1109 ms 4096 KB
subtask1_11.txt AC 1097 ms 4096 KB
subtask1_12.txt AC 1107 ms 4096 KB
subtask1_13.txt AC 1114 ms 4096 KB
subtask1_14.txt AC 1112 ms 4096 KB
subtask1_15.txt AC 1109 ms 4096 KB
subtask2_01.txt TLE 3155 ms 4096 KB
subtask2_02.txt TLE 3155 ms 4096 KB
subtask2_03.txt TLE 3155 ms 4096 KB
subtask2_04.txt TLE 3155 ms 4096 KB
subtask2_05.txt TLE 3155 ms 2304 KB
subtask2_06.txt TLE 3155 ms 4096 KB
subtask2_07.txt TLE 3155 ms 4096 KB
subtask2_08.txt TLE 3155 ms 4096 KB
subtask2_09.txt TLE 3155 ms 4096 KB
subtask2_10.txt TLE 3155 ms 4096 KB
subtask2_11.txt TLE 3155 ms 4096 KB
subtask2_12.txt TLE 3155 ms 4096 KB
subtask2_13.txt TLE 3155 ms 4096 KB
subtask2_14.txt TLE 3155 ms 4096 KB
subtask2_15.txt TLE 3155 ms 4096 KB
subtask2_16.txt TLE 3155 ms 4096 KB
subtask2_17.txt TLE 3155 ms 4096 KB
subtask2_18.txt TLE 3155 ms 4096 KB
subtask2_19.txt TLE 3155 ms 4096 KB
subtask2_20.txt TLE 3155 ms 4096 KB
subtask2_21.txt TLE 3155 ms 4096 KB
subtask2_22.txt TLE 3155 ms 4096 KB
subtask2_23.txt TLE 3155 ms 4096 KB
subtask2_24.txt TLE 3155 ms 4096 KB
subtask2_25.txt TLE 3155 ms 4096 KB