Submission #2205629


Source Code Expand

#include<stdio.h>
int main()
{
    int n;
    scanf("%d", &n);
    int v[1000001];
    int i;
    for (i = 0; i <= 1000000; i++)
        v[i] = 0;
    int a, b;
    for (i = 0; i < n; i++)
    {
        scanf("%d %d", &a, &b);
        v[a]++;
        v[b + 1]--;
    }
    for (i = 1; i <= 1000000; i++)
        v[i] += v[i - 1];
    int ans = 0;
    for (i = 0; i <= 1000000; i++)
        if (ans < v[i])
            ans = v[i];
    printf("%d\n", ans);
    return 0;
}

Submission Info

Submission Time
Task C - AtColor
User pengin
Language C (GCC 5.4.1)
Score 100
Code Size 494 Byte
Status AC
Exec Time 27 ms
Memory 4224 KB

Compile Error

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

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 2
AC × 17
AC × 42
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 5 ms 4096 KB
subtask0_sample02.txt AC 5 ms 4096 KB
subtask1_01.txt AC 5 ms 4096 KB
subtask1_02.txt AC 5 ms 4096 KB
subtask1_03.txt AC 6 ms 4096 KB
subtask1_04.txt AC 6 ms 4096 KB
subtask1_05.txt AC 5 ms 4096 KB
subtask1_06.txt AC 6 ms 4096 KB
subtask1_07.txt AC 6 ms 4096 KB
subtask1_08.txt AC 6 ms 4096 KB
subtask1_09.txt AC 6 ms 4096 KB
subtask1_10.txt AC 5 ms 4096 KB
subtask1_11.txt AC 5 ms 4096 KB
subtask1_12.txt AC 5 ms 4096 KB
subtask1_13.txt AC 6 ms 4096 KB
subtask1_14.txt AC 5 ms 4096 KB
subtask1_15.txt AC 6 ms 4096 KB
subtask2_01.txt AC 21 ms 4096 KB
subtask2_02.txt AC 23 ms 4096 KB
subtask2_03.txt AC 21 ms 4096 KB
subtask2_04.txt AC 23 ms 4096 KB
subtask2_05.txt AC 22 ms 4096 KB
subtask2_06.txt AC 24 ms 4096 KB
subtask2_07.txt AC 24 ms 4096 KB
subtask2_08.txt AC 24 ms 4096 KB
subtask2_09.txt AC 24 ms 4096 KB
subtask2_10.txt AC 24 ms 4096 KB
subtask2_11.txt AC 24 ms 4096 KB
subtask2_12.txt AC 24 ms 4096 KB
subtask2_13.txt AC 27 ms 4096 KB
subtask2_14.txt AC 24 ms 4096 KB
subtask2_15.txt AC 24 ms 4096 KB
subtask2_16.txt AC 24 ms 4096 KB
subtask2_17.txt AC 24 ms 4096 KB
subtask2_18.txt AC 24 ms 4096 KB
subtask2_19.txt AC 24 ms 4096 KB
subtask2_20.txt AC 24 ms 4096 KB
subtask2_21.txt AC 24 ms 4096 KB
subtask2_22.txt AC 24 ms 4224 KB
subtask2_23.txt AC 24 ms 4096 KB
subtask2_24.txt AC 25 ms 4096 KB
subtask2_25.txt AC 24 ms 4096 KB