Submission #230451


Source Code Expand

#include <stdio.h>

int main( void )
{
    long n;
    char dmy;
    long i, j;
    long a;
    long b;
    long r[1000001] = {0};

    scanf( "%ld%[^\n]", &n, &dmy );
    for ( i = 0; i < n; i++ ) {
        scanf( "%ld %ld%[^\n]", &a, &b, &dmy );
        for ( j = a; j <= b; j++ ) {
            r[j]++;
        }
    }
    j = 0;
    for ( i = 0; i < 1000001; i++ ) {
        if ( r[i] > j ) j = r[i];
    }
    printf( "%ld\n", j );

    return 0;
}

Submission Info

Submission Time
Task C - AtColor
User mkgr
Language C (GCC 4.6.4)
Score 0
Code Size 479 Byte
Status TLE
Exec Time 3042 ms
Memory 8624 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:12:10: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:14: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 0 / 30 0 / 70
Status
AC × 2
AC × 13
TLE × 4
AC × 14
TLE × 28
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 41 ms 8476 KB
subtask0_sample02.txt AC 42 ms 8416 KB
subtask1_01.txt AC 37 ms 8488 KB
subtask1_02.txt AC 38 ms 8604 KB
subtask1_03.txt TLE 3031 ms 8616 KB
subtask1_04.txt TLE 3032 ms 8600 KB
subtask1_05.txt TLE 3032 ms 8624 KB
subtask1_06.txt TLE 3032 ms 8620 KB
subtask1_07.txt AC 36 ms 8488 KB
subtask1_08.txt AC 1585 ms 8488 KB
subtask1_09.txt AC 1524 ms 8484 KB
subtask1_10.txt AC 1495 ms 8484 KB
subtask1_11.txt AC 1570 ms 8432 KB
subtask1_12.txt AC 1547 ms 8488 KB
subtask1_13.txt AC 1558 ms 8484 KB
subtask1_14.txt AC 1540 ms 8416 KB
subtask1_15.txt AC 1522 ms 8428 KB
subtask2_01.txt TLE 3033 ms 8612 KB
subtask2_02.txt TLE 3033 ms 8608 KB
subtask2_03.txt TLE 3033 ms 8532 KB
subtask2_04.txt TLE 3042 ms 8596 KB
subtask2_05.txt AC 74 ms 8484 KB
subtask2_06.txt TLE 3033 ms 8608 KB
subtask2_07.txt TLE 3033 ms 8604 KB
subtask2_08.txt TLE 3032 ms 8616 KB
subtask2_09.txt TLE 3032 ms 8612 KB
subtask2_10.txt TLE 3031 ms 8612 KB
subtask2_11.txt TLE 3033 ms 8604 KB
subtask2_12.txt TLE 3033 ms 8612 KB
subtask2_13.txt TLE 3032 ms 8604 KB
subtask2_14.txt TLE 3033 ms 8612 KB
subtask2_15.txt TLE 3032 ms 8592 KB
subtask2_16.txt TLE 3033 ms 8604 KB
subtask2_17.txt TLE 3034 ms 8616 KB
subtask2_18.txt TLE 3031 ms 8620 KB
subtask2_19.txt TLE 3032 ms 8616 KB
subtask2_20.txt TLE 3033 ms 8608 KB
subtask2_21.txt TLE 3031 ms 8616 KB
subtask2_22.txt TLE 3032 ms 8616 KB
subtask2_23.txt TLE 3033 ms 8532 KB
subtask2_24.txt TLE 3031 ms 8612 KB
subtask2_25.txt TLE 3034 ms 8616 KB