Submission #1520876


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main(){
    int n,*heap,i,j,x,y;
    heap = (int*)malloc(sizeof(int)*1000001);
    if (heap == NULL) exit(0);
    for(i=0;i<1000001;i++){
        heap[i] = 0;
    }
    scanf("%d",&n);
    int unko=-114514;
    for(i=0;i<n;i++){
        scanf("%d %d",&x,&y);
        for(j=x;j<=y;j++){
            heap [j] ++;
        }
    }
    for(i=0;i<1000001;i++){
        if(heap[i] > unko){
            unko = heap[i];
        }
    }
    printf("%d\n",unko);
    free (heap);
}

Submission Info

Submission Time
Task C - AtColor
User r67pr
Language C++14 (GCC 5.4.1)
Score 30
Code Size 546 Byte
Status TLE
Exec Time 3156 ms
Memory 4096 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
./Main.cpp:14:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, 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 30 / 30 0 / 70
Status
AC × 2
AC × 17
AC × 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 AC 4 ms 4096 KB
subtask0_sample02.txt AC 5 ms 4096 KB
subtask1_01.txt AC 4 ms 4096 KB
subtask1_02.txt AC 4 ms 4096 KB
subtask1_03.txt AC 1049 ms 4096 KB
subtask1_04.txt AC 1048 ms 4096 KB
subtask1_05.txt AC 1048 ms 4096 KB
subtask1_06.txt AC 1061 ms 4096 KB
subtask1_07.txt AC 4 ms 4096 KB
subtask1_08.txt AC 353 ms 4096 KB
subtask1_09.txt AC 358 ms 4096 KB
subtask1_10.txt AC 351 ms 4096 KB
subtask1_11.txt AC 360 ms 4096 KB
subtask1_12.txt AC 346 ms 4096 KB
subtask1_13.txt AC 356 ms 4096 KB
subtask1_14.txt AC 344 ms 4096 KB
subtask1_15.txt AC 353 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 3156 ms 4096 KB
subtask2_05.txt AC 20 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