Submission #230457


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <functional>

using namespace std;

int main(){
    int n;
    int cnt[1000001] = {0};

    scanf("%d",&n);

    for(int i=0;i<n;i++){
        int t1,t2;
        scanf("%d %d",&t1,&t2);
        if (t1 != t2){
            for(int j=t1;j<=t2;j++){
                cnt[j]++;
            }
        }
        else {
            cnt[t1]++;
        }
   }

    sort(cnt,cnt+1000001,greater<int>());

    printf("%d\n",cnt[0]);

    return 0;
}

Submission Info

Submission Time
Task C - AtColor
User taikoubou
Language C++ (G++ 4.6.4)
Score 30
Code Size 516 Byte
Status TLE
Exec Time 3040 ms
Memory 4700 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]
./Main.cpp:15:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

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 53 ms 4512 KB
subtask0_sample02.txt AC 57 ms 4508 KB
subtask1_01.txt AC 53 ms 4516 KB
subtask1_02.txt AC 57 ms 4644 KB
subtask1_03.txt AC 2473 ms 4512 KB
subtask1_04.txt AC 2511 ms 4520 KB
subtask1_05.txt AC 2469 ms 4512 KB
subtask1_06.txt AC 2475 ms 4520 KB
subtask1_07.txt AC 53 ms 4508 KB
subtask1_08.txt AC 901 ms 4576 KB
subtask1_09.txt AC 880 ms 4516 KB
subtask1_10.txt AC 880 ms 4512 KB
subtask1_11.txt AC 895 ms 4572 KB
subtask1_12.txt AC 880 ms 4516 KB
subtask1_13.txt AC 883 ms 4516 KB
subtask1_14.txt AC 885 ms 4516 KB
subtask1_15.txt AC 879 ms 4640 KB
subtask2_01.txt TLE 3035 ms 4640 KB
subtask2_02.txt TLE 3034 ms 4640 KB
subtask2_03.txt TLE 3034 ms 4640 KB
subtask2_04.txt TLE 3034 ms 4644 KB
subtask2_05.txt AC 82 ms 4516 KB
subtask2_06.txt TLE 3035 ms 4644 KB
subtask2_07.txt TLE 3034 ms 4644 KB
subtask2_08.txt TLE 3035 ms 4648 KB
subtask2_09.txt TLE 3034 ms 4648 KB
subtask2_10.txt TLE 3040 ms 4700 KB
subtask2_11.txt TLE 3037 ms 4636 KB
subtask2_12.txt TLE 3034 ms 4644 KB
subtask2_13.txt TLE 3037 ms 4640 KB
subtask2_14.txt TLE 3035 ms 4640 KB
subtask2_15.txt TLE 3034 ms 4648 KB
subtask2_16.txt TLE 3035 ms 4640 KB
subtask2_17.txt TLE 3034 ms 4624 KB
subtask2_18.txt TLE 3034 ms 4644 KB
subtask2_19.txt TLE 3035 ms 4636 KB
subtask2_20.txt TLE 3035 ms 4640 KB
subtask2_21.txt TLE 3034 ms 4644 KB
subtask2_22.txt TLE 3034 ms 4648 KB
subtask2_23.txt TLE 3038 ms 4636 KB
subtask2_24.txt TLE 3035 ms 4656 KB
subtask2_25.txt TLE 3035 ms 4640 KB