Submission #1768897


Source Code Expand

#include<cstdio>
#include<algorithm>

using namespace std;

int c[1000010];

int main(){
	int n;
	scanf("%d", &n);
	for(int i = 0; i < n; i++){
		int a, b; scanf("%d %d", &a, &b);
		c[a]++; c[b + 1]--;
	}
	for(int i = 0; i <= 1000000; i++) c[i + 1] += c[i];
	int res = 0;
	for(int i = 0; i <= 1000000; i++) res = max(res, c[i]);
	printf("%d\n", res);
	return 0;
}

Submission Info

Submission Time
Task C - AtColor
User orpheus
Language C++14 (GCC 5.4.1)
Score 100
Code Size 382 Byte
Status AC
Exec Time 29 ms
Memory 4096 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:12:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int a, b; 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 4 ms 4096 KB
subtask0_sample02.txt AC 4 ms 4096 KB
subtask1_01.txt AC 4 ms 4096 KB
subtask1_02.txt AC 4 ms 4096 KB
subtask1_03.txt AC 4 ms 4096 KB
subtask1_04.txt AC 5 ms 4096 KB
subtask1_05.txt AC 5 ms 4096 KB
subtask1_06.txt AC 5 ms 4096 KB
subtask1_07.txt AC 5 ms 4096 KB
subtask1_08.txt AC 4 ms 4096 KB
subtask1_09.txt AC 4 ms 4096 KB
subtask1_10.txt AC 4 ms 4096 KB
subtask1_11.txt AC 4 ms 4096 KB
subtask1_12.txt AC 4 ms 4096 KB
subtask1_13.txt AC 4 ms 4096 KB
subtask1_14.txt AC 4 ms 4096 KB
subtask1_15.txt AC 4 ms 4096 KB
subtask2_01.txt AC 20 ms 4096 KB
subtask2_02.txt AC 21 ms 4096 KB
subtask2_03.txt AC 19 ms 4096 KB
subtask2_04.txt AC 21 ms 4096 KB
subtask2_05.txt AC 20 ms 4096 KB
subtask2_06.txt AC 23 ms 4096 KB
subtask2_07.txt AC 25 ms 4096 KB
subtask2_08.txt AC 26 ms 4096 KB
subtask2_09.txt AC 23 ms 4096 KB
subtask2_10.txt AC 28 ms 4096 KB
subtask2_11.txt AC 23 ms 4096 KB
subtask2_12.txt AC 24 ms 4096 KB
subtask2_13.txt AC 24 ms 4096 KB
subtask2_14.txt AC 23 ms 4096 KB
subtask2_15.txt AC 23 ms 4096 KB
subtask2_16.txt AC 23 ms 4096 KB
subtask2_17.txt AC 23 ms 4096 KB
subtask2_18.txt AC 24 ms 4096 KB
subtask2_19.txt AC 23 ms 4096 KB
subtask2_20.txt AC 23 ms 4096 KB
subtask2_21.txt AC 24 ms 4096 KB
subtask2_22.txt AC 29 ms 4096 KB
subtask2_23.txt AC 24 ms 4096 KB
subtask2_24.txt AC 22 ms 4096 KB
subtask2_25.txt AC 25 ms 4096 KB