Submission #4047584


Source Code Expand

#include <stdio.h>
#include <math.h>
int max(int a, int b){
    return a>b?a:b;
    
}
int main(int argc, const char * argv[]) {
    int i, j, x, y;
    long long n;
    int count[1000001] = {};
    scanf("%lld", &n);
    
    for(i=0; i<n; i++){
        scanf("%d%d",&x, &y);
        for(j=x;  j<y+1;  j++){
            count[j]++;

        }
        
    }
    


    for (i=0; i<1000001; i++){
        count[0]=max(count[0],count[i]);
    }
    printf("%d",count[0]);
    
    return 0;
}

Submission Info

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

Compile Error

./Main.c: In function ‘main’:
./Main.c:11:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld", &n);
     ^
./Main.c:14:9: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&x, &y);
         ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
WA × 2
WA × 17
WA × 18
TLE × 24
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 3 ms 4096 KB
subtask0_sample02.txt WA 4 ms 4096 KB
subtask1_01.txt WA 3 ms 4096 KB
subtask1_02.txt WA 3 ms 4096 KB
subtask1_03.txt WA 1398 ms 4096 KB
subtask1_04.txt WA 1397 ms 4096 KB
subtask1_05.txt WA 1395 ms 4096 KB
subtask1_06.txt WA 1396 ms 4096 KB
subtask1_07.txt WA 3 ms 4096 KB
subtask1_08.txt WA 469 ms 4096 KB
subtask1_09.txt WA 470 ms 4096 KB
subtask1_10.txt WA 466 ms 4096 KB
subtask1_11.txt WA 479 ms 4096 KB
subtask1_12.txt WA 462 ms 4096 KB
subtask1_13.txt WA 473 ms 4096 KB
subtask1_14.txt WA 456 ms 4096 KB
subtask1_15.txt WA 468 ms 4096 KB
subtask2_01.txt TLE 3155 ms 4096 KB
subtask2_02.txt TLE 3159 ms 4096 KB
subtask2_03.txt TLE 3155 ms 4096 KB
subtask2_04.txt TLE 3155 ms 4096 KB
subtask2_05.txt WA 19 ms 4096 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