Submission #1367733


Source Code Expand

#include<iostream>
using namespace std;

int main() {
	int n;
	cin >> n;
	int a[100005], b[100005], ans[100005];
	for (int i = 0; i < n; i++) { cin >> a[i] >> b[i] ; }
	for(int i = 0;i <= 1000000;i++){
		for (int j = 0; j < n; j++) {
			if (a[j] <= i && i <= b[j]) {
				ans[i]++;
			}
	   }
	}
	int max = 0,X;
	for (int i = 0; i <= 1000000; i++) {
		if (ans[i] > max) { max = ans[i];
		                      X = i;
		}

	}
	cout << X << endl;
	return 0;
}

Submission Info

Submission Time
Task C - AtColor
User Shokatsu
Language C++14 (GCC 5.4.1)
Score 0
Code Size 480 Byte
Status RE
Exec Time 3155 ms
Memory 1280 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:18:12: warning: iteration 100005u invokes undefined behavior [-Waggressive-loop-optimizations]
   if (ans[i] > max) { max = ans[i];
            ^
./Main.cpp:17:20: note: containing loop
  for (int i = 0; i <= 1000000; i++) {
                    ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
RE × 2
RE × 17
TLE × 25
RE × 17
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 RE 110 ms 256 KB
subtask0_sample02.txt RE 109 ms 640 KB
subtask1_01.txt RE 109 ms 256 KB
subtask1_02.txt RE 107 ms 256 KB
subtask1_03.txt RE 540 ms 640 KB
subtask1_04.txt RE 535 ms 640 KB
subtask1_05.txt RE 539 ms 640 KB
subtask1_06.txt RE 533 ms 640 KB
subtask1_07.txt RE 2088 ms 256 KB
subtask1_08.txt RE 410 ms 640 KB
subtask1_09.txt RE 406 ms 640 KB
subtask1_10.txt RE 408 ms 640 KB
subtask1_11.txt RE 412 ms 640 KB
subtask1_12.txt RE 408 ms 640 KB
subtask1_13.txt RE 426 ms 640 KB
subtask1_14.txt RE 422 ms 640 KB
subtask1_15.txt RE 411 ms 640 KB
subtask2_01.txt TLE 3155 ms 1024 KB
subtask2_02.txt TLE 3155 ms 1152 KB
subtask2_03.txt TLE 3155 ms 1024 KB
subtask2_04.txt TLE 3155 ms 1152 KB
subtask2_05.txt TLE 3155 ms 1152 KB
subtask2_06.txt TLE 3155 ms 1152 KB
subtask2_07.txt TLE 3155 ms 1152 KB
subtask2_08.txt TLE 3155 ms 1152 KB
subtask2_09.txt TLE 3155 ms 1152 KB
subtask2_10.txt TLE 3155 ms 1152 KB
subtask2_11.txt TLE 3155 ms 1152 KB
subtask2_12.txt TLE 3155 ms 1152 KB
subtask2_13.txt TLE 3155 ms 1152 KB
subtask2_14.txt TLE 3155 ms 1152 KB
subtask2_15.txt TLE 3155 ms 1152 KB
subtask2_16.txt TLE 3155 ms 1280 KB
subtask2_17.txt TLE 3155 ms 1152 KB
subtask2_18.txt TLE 3155 ms 1152 KB
subtask2_19.txt TLE 3155 ms 1152 KB
subtask2_20.txt TLE 3155 ms 1152 KB
subtask2_21.txt TLE 3155 ms 1152 KB
subtask2_22.txt TLE 3155 ms 1152 KB
subtask2_23.txt TLE 3155 ms 1152 KB
subtask2_24.txt TLE 3155 ms 1152 KB
subtask2_25.txt TLE 3155 ms 1152 KB