Submission #229949


Source Code Expand

#include <stdio.h>

int main(void) {
	int fav[1000001];
	for(int i=0;i<1000001;i++) fav[i]=0;
    int max;
    scanf("%d",&max);
    int l[2];
    for (int i = 0; i < max; i++)
    {
        scanf("%d %d",l,l+1);
        for (int j = 0; j < (l[1] - l[0] + 1); j++)
        {
            fav[l[0] + j]++;
        }
    }
    int ret=0;
    for(int i=0;i<1000001;i++) {
		if (fav[i]>ret) ret=fav[i];
	}
	printf("%d\n",ret);
	return 0;
}

Submission Info

Submission Time
Task C - AtColor
User kb10uy
Language C++ (G++ 4.6.4)
Score 0
Code Size 456 Byte
Status TLE
Exec Time 3046 ms
Memory 4652 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:7:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:11:29: 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 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 32 ms 4628 KB
subtask0_sample02.txt AC 35 ms 4628 KB
subtask1_01.txt AC 32 ms 4512 KB
subtask1_02.txt AC 35 ms 4504 KB
subtask1_03.txt TLE 3036 ms 4624 KB
subtask1_04.txt TLE 3032 ms 4644 KB
subtask1_05.txt TLE 3036 ms 4644 KB
subtask1_06.txt TLE 3035 ms 4636 KB
subtask1_07.txt AC 34 ms 4568 KB
subtask1_08.txt AC 1158 ms 4520 KB
subtask1_09.txt AC 1166 ms 4512 KB
subtask1_10.txt AC 1162 ms 4516 KB
subtask1_11.txt AC 1187 ms 4512 KB
subtask1_12.txt AC 1139 ms 4512 KB
subtask1_13.txt AC 1170 ms 4632 KB
subtask1_14.txt AC 1133 ms 4636 KB
subtask1_15.txt AC 1165 ms 4572 KB
subtask2_01.txt TLE 3033 ms 4644 KB
subtask2_02.txt TLE 3037 ms 4628 KB
subtask2_03.txt TLE 3036 ms 4636 KB
subtask2_04.txt TLE 3034 ms 4636 KB
subtask2_05.txt AC 61 ms 4516 KB
subtask2_06.txt TLE 3035 ms 4636 KB
subtask2_07.txt TLE 3033 ms 4652 KB
subtask2_08.txt TLE 3046 ms 4640 KB
subtask2_09.txt TLE 3035 ms 4636 KB
subtask2_10.txt TLE 3034 ms 4636 KB
subtask2_11.txt TLE 3034 ms 4640 KB
subtask2_12.txt TLE 3034 ms 4644 KB
subtask2_13.txt TLE 3034 ms 4652 KB
subtask2_14.txt TLE 3033 ms 4640 KB
subtask2_15.txt TLE 3034 ms 4644 KB
subtask2_16.txt TLE 3034 ms 4636 KB
subtask2_17.txt TLE 3033 ms 4640 KB
subtask2_18.txt TLE 3035 ms 4636 KB
subtask2_19.txt TLE 3034 ms 4644 KB
subtask2_20.txt TLE 3038 ms 4640 KB
subtask2_21.txt TLE 3034 ms 4640 KB
subtask2_22.txt TLE 3034 ms 4628 KB
subtask2_23.txt TLE 3033 ms 4648 KB
subtask2_24.txt TLE 3032 ms 4636 KB
subtask2_25.txt TLE 3033 ms 4644 KB