Submission #230427


Source Code Expand

#include <stdio.h>

#define NMAX 100000
#define CMAX 1000001

int main(int argc, char **argv)
{
    int n = 0;
    int c[CMAX] = {0};
    int a = 0;
    int b = 0;
    int i = 0;
    int j = 0;
    int ans = 0;

    scanf("%d", &n);
    for (i = 0; i < n; i++) {
        scanf("%d %d", &a, &b);
        
        for (j = a; j <= b; j++) {
            c[j]++;
        }
    }

    for (i = 0; i < CMAX; i++) {
        if (ans < c[i]) {
            ans = c[i];
        }
    }

    printf("%d\n", ans);

    return 0;
}

Submission Info

Submission Time
Task C - AtColor
User kaneda
Language C (GCC 4.6.4)
Score 30
Code Size 550 Byte
Status TLE
Exec Time 3034 ms
Memory 4648 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:16:10: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:18:14: warning: ignoring return value of ‘scanf’, 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 29 ms 4512 KB
subtask0_sample02.txt AC 33 ms 4636 KB
subtask1_01.txt AC 29 ms 4516 KB
subtask1_02.txt AC 30 ms 4516 KB
subtask1_03.txt AC 2471 ms 4576 KB
subtask1_04.txt AC 2483 ms 4572 KB
subtask1_05.txt AC 2490 ms 4508 KB
subtask1_06.txt AC 2484 ms 4636 KB
subtask1_07.txt AC 30 ms 4640 KB
subtask1_08.txt AC 844 ms 4640 KB
subtask1_09.txt AC 847 ms 4580 KB
subtask1_10.txt AC 842 ms 4636 KB
subtask1_11.txt AC 865 ms 4516 KB
subtask1_12.txt AC 831 ms 4512 KB
subtask1_13.txt AC 855 ms 4632 KB
subtask1_14.txt AC 828 ms 4512 KB
subtask1_15.txt AC 844 ms 4640 KB
subtask2_01.txt TLE 3032 ms 4644 KB
subtask2_02.txt TLE 3033 ms 4636 KB
subtask2_03.txt TLE 3033 ms 4640 KB
subtask2_04.txt TLE 3034 ms 4636 KB
subtask2_05.txt AC 60 ms 4512 KB
subtask2_06.txt TLE 3033 ms 4648 KB
subtask2_07.txt TLE 3033 ms 4636 KB
subtask2_08.txt TLE 3033 ms 4644 KB
subtask2_09.txt TLE 3031 ms 4632 KB
subtask2_10.txt TLE 3031 ms 4644 KB
subtask2_11.txt TLE 3034 ms 4644 KB
subtask2_12.txt TLE 3033 ms 4640 KB
subtask2_13.txt TLE 3033 ms 4640 KB
subtask2_14.txt TLE 3034 ms 4632 KB
subtask2_15.txt TLE 3033 ms 4640 KB
subtask2_16.txt TLE 3032 ms 4640 KB
subtask2_17.txt TLE 3033 ms 4648 KB
subtask2_18.txt TLE 3033 ms 4640 KB
subtask2_19.txt TLE 3034 ms 4628 KB
subtask2_20.txt TLE 3033 ms 4640 KB
subtask2_21.txt TLE 3031 ms 4640 KB
subtask2_22.txt TLE 3034 ms 4644 KB
subtask2_23.txt TLE 3031 ms 4644 KB
subtask2_24.txt TLE 3033 ms 4640 KB
subtask2_25.txt TLE 3034 ms 4632 KB