Submission #7467596


Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Rep(i,n) for(int (i)=n;(i)>(0);(i)--)
using namespace std;

int main() {
	int a[100000];
	int b[100000];
	int N;
	int max = 0;
	int rec = 0;
	cin >> N;
	rep(i, N) {
		cin >> a[i] >> b[i];
	}
	rep(j, 1000001) {
		rep(i, N) {
			if (j >= a[i] && j <= b[i]) {
				rec++;
			}
		}
		if (max < rec) {
			max = rec;
		}
		rec = 0;
	}
	cout << max << endl;
	return 0;
}

Submission Info

Submission Time
Task C - AtColor
User moopu
Language C++14 (GCC 5.4.1)
Score 0
Code Size 499 Byte
Status TLE
Exec Time 3155 ms
Memory 1024 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 2
AC × 9
TLE × 8
AC × 9
TLE × 33
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 6 ms 256 KB
subtask0_sample02.txt AC 4 ms 256 KB
subtask1_01.txt AC 3 ms 256 KB
subtask1_02.txt AC 4 ms 256 KB
subtask1_03.txt AC 1956 ms 256 KB
subtask1_04.txt AC 1955 ms 256 KB
subtask1_05.txt AC 1955 ms 256 KB
subtask1_06.txt AC 1956 ms 256 KB
subtask1_07.txt AC 1956 ms 256 KB
subtask1_08.txt TLE 3028 ms 256 KB
subtask1_09.txt TLE 3038 ms 256 KB
subtask1_10.txt TLE 3071 ms 256 KB
subtask1_11.txt TLE 3061 ms 256 KB
subtask1_12.txt TLE 3061 ms 256 KB
subtask1_13.txt TLE 3078 ms 256 KB
subtask1_14.txt TLE 3050 ms 256 KB
subtask1_15.txt TLE 3059 ms 256 KB
subtask2_01.txt TLE 3155 ms 1024 KB
subtask2_02.txt TLE 3155 ms 1024 KB
subtask2_03.txt TLE 3155 ms 1024 KB
subtask2_04.txt TLE 3155 ms 1024 KB
subtask2_05.txt TLE 3155 ms 1024 KB
subtask2_06.txt TLE 3155 ms 1024 KB
subtask2_07.txt TLE 3155 ms 1024 KB
subtask2_08.txt TLE 3155 ms 1024 KB
subtask2_09.txt TLE 3155 ms 1024 KB
subtask2_10.txt TLE 3155 ms 1024 KB
subtask2_11.txt TLE 3155 ms 1024 KB
subtask2_12.txt TLE 3155 ms 1024 KB
subtask2_13.txt TLE 3155 ms 1024 KB
subtask2_14.txt TLE 3155 ms 1024 KB
subtask2_15.txt TLE 3155 ms 1024 KB
subtask2_16.txt TLE 3155 ms 1024 KB
subtask2_17.txt TLE 3155 ms 1024 KB
subtask2_18.txt TLE 3155 ms 1024 KB
subtask2_19.txt TLE 3155 ms 1024 KB
subtask2_20.txt TLE 3155 ms 1024 KB
subtask2_21.txt TLE 3155 ms 1024 KB
subtask2_22.txt TLE 3155 ms 1024 KB
subtask2_23.txt TLE 3155 ms 1024 KB
subtask2_24.txt TLE 3155 ms 1024 KB
subtask2_25.txt TLE 3155 ms 1024 KB