Submission #2236233


Source Code Expand

#include <iostream>

using namespace std;

int main(void){
	int n;

	cin >> n;

	static int d[1000001] = {};

	int a, b;

	for (int i = 0; i < n; i++){
		cin >> a >> b;

		d[a]++;
		d[b+1]--;
	}

	int max = 0;
	for (int i = 0; i < 1000001; i++){
		d[i+1] += d[i];
		if (max < d[i])
			max = d[i];
	}


	cout << max << endl;
}

Submission Info

Submission Time
Task C - AtColor
User h2929
Language C++14 (GCC 5.4.1)
Score 100
Code Size 354 Byte
Status AC
Exec Time 87 ms
Memory 4224 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:23:17: warning: iteration 1000000u invokes undefined behavior [-Waggressive-loop-optimizations]
   d[i+1] += d[i];
                 ^
./Main.cpp:22:20: note: containing loop
  for (int i = 0; i < 1000001; i++){
                    ^

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 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 5 ms 4096 KB
subtask1_08.txt AC 5 ms 4096 KB
subtask1_09.txt AC 5 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 5 ms 4096 KB
subtask1_14.txt AC 5 ms 4096 KB
subtask1_15.txt AC 5 ms 4096 KB
subtask2_01.txt AC 65 ms 4096 KB
subtask2_02.txt AC 86 ms 4096 KB
subtask2_03.txt AC 61 ms 4096 KB
subtask2_04.txt AC 79 ms 4096 KB
subtask2_05.txt AC 73 ms 4096 KB
subtask2_06.txt AC 85 ms 4096 KB
subtask2_07.txt AC 84 ms 4096 KB
subtask2_08.txt AC 86 ms 4096 KB
subtask2_09.txt AC 85 ms 4096 KB
subtask2_10.txt AC 87 ms 4096 KB
subtask2_11.txt AC 82 ms 4096 KB
subtask2_12.txt AC 87 ms 4096 KB
subtask2_13.txt AC 84 ms 4096 KB
subtask2_14.txt AC 84 ms 4096 KB
subtask2_15.txt AC 82 ms 4096 KB
subtask2_16.txt AC 84 ms 4096 KB
subtask2_17.txt AC 82 ms 4096 KB
subtask2_18.txt AC 84 ms 4096 KB
subtask2_19.txt AC 83 ms 4096 KB
subtask2_20.txt AC 85 ms 4096 KB
subtask2_21.txt AC 84 ms 4224 KB
subtask2_22.txt AC 83 ms 4096 KB
subtask2_23.txt AC 84 ms 4096 KB
subtask2_24.txt AC 82 ms 4096 KB
subtask2_25.txt AC 85 ms 4096 KB