Submission #4706627


Source Code Expand

#include<stdio.h>

int main(void)
{
  int a,b,n,i,j,max,max1=0;
  int count[1000002]={0};

  scanf("%d",&n);
  
  for(i=0;i<n;i++){
    scanf("%d %d",&a,&b);
    count[a]++;
    count[b+1]--;
    max1=max1>a?max1:a;
    max1=max1>b?max1:b;
  }
  
    max=count[0];
  for(i=1;i<=max1;i++)
    {
      count[i]+=count[i-1];
    if(max<count[i]){
      max=count[i];
    }
  }
  printf("%d\n",max);
  return 0;
}

Submission Info

Submission Time
Task C - AtColor
User uzumi2980
Language C (GCC 5.4.1)
Score 100
Code Size 438 Byte
Status AC
Exec Time 26 ms
Memory 4096 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:8:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
   ^
./Main.c:11: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 30 / 30 70 / 70
Status
AC × 2
AC × 17
AC × 42
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 2 ms 4096 KB
subtask0_sample02.txt AC 3 ms 4096 KB
subtask1_01.txt AC 2 ms 4096 KB
subtask1_02.txt AC 2 ms 4096 KB
subtask1_03.txt AC 3 ms 4096 KB
subtask1_04.txt AC 3 ms 4096 KB
subtask1_05.txt AC 3 ms 4096 KB
subtask1_06.txt AC 3 ms 4096 KB
subtask1_07.txt AC 2 ms 4096 KB
subtask1_08.txt AC 3 ms 4096 KB
subtask1_09.txt AC 3 ms 4096 KB
subtask1_10.txt AC 3 ms 4096 KB
subtask1_11.txt AC 3 ms 4096 KB
subtask1_12.txt AC 3 ms 4096 KB
subtask1_13.txt AC 3 ms 4096 KB
subtask1_14.txt AC 3 ms 4096 KB
subtask1_15.txt AC 3 ms 4096 KB
subtask2_01.txt AC 19 ms 4096 KB
subtask2_02.txt AC 21 ms 4096 KB
subtask2_03.txt AC 19 ms 4096 KB
subtask2_04.txt AC 20 ms 4096 KB
subtask2_05.txt AC 19 ms 4096 KB
subtask2_06.txt AC 24 ms 4096 KB
subtask2_07.txt AC 24 ms 4096 KB
subtask2_08.txt AC 24 ms 4096 KB
subtask2_09.txt AC 23 ms 4096 KB
subtask2_10.txt AC 25 ms 4096 KB
subtask2_11.txt AC 23 ms 4096 KB
subtask2_12.txt AC 22 ms 4096 KB
subtask2_13.txt AC 22 ms 4096 KB
subtask2_14.txt AC 22 ms 4096 KB
subtask2_15.txt AC 22 ms 4096 KB
subtask2_16.txt AC 22 ms 4096 KB
subtask2_17.txt AC 22 ms 4096 KB
subtask2_18.txt AC 26 ms 4096 KB
subtask2_19.txt AC 22 ms 4096 KB
subtask2_20.txt AC 22 ms 4096 KB
subtask2_21.txt AC 22 ms 4096 KB
subtask2_22.txt AC 24 ms 4096 KB
subtask2_23.txt AC 22 ms 4096 KB
subtask2_24.txt AC 22 ms 4096 KB
subtask2_25.txt AC 22 ms 4096 KB