Submission #4643327


Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int color[1000001];

int main()
{
	int n;
	cin >> n;
	
	int maxv = 0;
	int minv = 1000002;
	int a, b;
	for( int i = 0; i < n; ++i )
	{
		cin >> a >> b;
		for( int l = a; l <= b; ++l )
		{
			color[l]++;
		}
		minv = min( { minv, a, b } );
		maxv = max( { maxv, a, b } );
	}

	int ans = 0;
	for( int i = minv; i <= maxv; ++i )
		ans = max( ans, color[i] );
	
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task C - AtColor
User Ringoame
Language C++14 (GCC 5.4.1)
Score 30
Code Size 502 Byte
Status TLE
Exec Time 3155 ms
Memory 4096 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 2
AC × 17
AC × 18
TLE × 24
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 1 ms 256 KB
subtask0_sample02.txt AC 5 ms 4096 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1410 ms 4096 KB
subtask1_04.txt AC 1408 ms 4096 KB
subtask1_05.txt AC 1409 ms 4096 KB
subtask1_06.txt AC 1407 ms 4096 KB
subtask1_07.txt AC 2 ms 256 KB
subtask1_08.txt AC 474 ms 4096 KB
subtask1_09.txt AC 475 ms 4096 KB
subtask1_10.txt AC 471 ms 4096 KB
subtask1_11.txt AC 484 ms 4096 KB
subtask1_12.txt AC 465 ms 4096 KB
subtask1_13.txt AC 478 ms 4096 KB
subtask1_14.txt AC 462 ms 4096 KB
subtask1_15.txt AC 474 ms 4096 KB
subtask2_01.txt TLE 3155 ms 4096 KB
subtask2_02.txt TLE 3155 ms 4096 KB
subtask2_03.txt TLE 3155 ms 4096 KB
subtask2_04.txt TLE 3155 ms 4096 KB
subtask2_05.txt AC 70 ms 640 KB
subtask2_06.txt TLE 3155 ms 4096 KB
subtask2_07.txt TLE 3155 ms 4096 KB
subtask2_08.txt TLE 3155 ms 4096 KB
subtask2_09.txt TLE 3155 ms 4096 KB
subtask2_10.txt TLE 3155 ms 4096 KB
subtask2_11.txt TLE 3155 ms 4096 KB
subtask2_12.txt TLE 3155 ms 4096 KB
subtask2_13.txt TLE 3155 ms 4096 KB
subtask2_14.txt TLE 3155 ms 4096 KB
subtask2_15.txt TLE 3155 ms 4096 KB
subtask2_16.txt TLE 3155 ms 4096 KB
subtask2_17.txt TLE 3155 ms 4096 KB
subtask2_18.txt TLE 3155 ms 4096 KB
subtask2_19.txt TLE 3155 ms 4096 KB
subtask2_20.txt TLE 3155 ms 4096 KB
subtask2_21.txt TLE 3155 ms 4096 KB
subtask2_22.txt TLE 3155 ms 4096 KB
subtask2_23.txt TLE 3155 ms 4096 KB
subtask2_24.txt TLE 3155 ms 4096 KB
subtask2_25.txt TLE 3155 ms 4096 KB