Submission #4032823


Source Code Expand

#include<iostream>
using namespace std;

int main(){
	int n;
	cin >> n;
	int i, j, a[n], b[n];
	for(i=0; i<n; i++){
		cin >> a[i] >> b[i];
	}
	
	int Min = 1000001, Max = -1;
	for(i=0; i<n; i++){
		if(Min > a[i])	Min = a[i];
		if(Max < b[i])	Max = b[i];
	}
	
	int c[n][Max]={0};
	for(i=0; i<n; i++){
		for(j=Min; j<=Max; j++){
			c[i][j] = 0;
		}
	}
	
	for(i=0; i<n; i++){
		for(j=a[i]; j<=b[i]; j++){
			c[i][j] = 1;
		}
	}
	
	int d[Max+1]={0}, ans=0;
	for(i=Min; i<=Max; i++){
		for(j=0; j<n; j++){
			if(c[i][j]==1)	d[i]++;
		}
		if(ans<d[i])	ans = d[i];
	}
	
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task C - AtColor
User hrn
Language C++14 (GCC 5.4.1)
Score 0
Code Size 638 Byte
Status RE
Exec Time 184 ms
Memory 19712 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 1
RE × 1
AC × 2
WA × 1
RE × 14
AC × 2
WA × 1
RE × 39
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 RE 112 ms 19712 KB
subtask1_01.txt RE 100 ms 640 KB
subtask1_02.txt WA 1 ms 256 KB
subtask1_03.txt RE 101 ms 256 KB
subtask1_04.txt RE 101 ms 256 KB
subtask1_05.txt RE 100 ms 256 KB
subtask1_06.txt RE 101 ms 256 KB
subtask1_07.txt AC 14 ms 15872 KB
subtask1_08.txt RE 104 ms 256 KB
subtask1_09.txt RE 102 ms 256 KB
subtask1_10.txt RE 102 ms 256 KB
subtask1_11.txt RE 105 ms 256 KB
subtask1_12.txt RE 103 ms 256 KB
subtask1_13.txt RE 101 ms 256 KB
subtask1_14.txt RE 102 ms 256 KB
subtask1_15.txt RE 103 ms 256 KB
subtask2_01.txt RE 165 ms 1024 KB
subtask2_02.txt RE 181 ms 1024 KB
subtask2_03.txt RE 160 ms 1024 KB
subtask2_04.txt RE 179 ms 1024 KB
subtask2_05.txt RE 172 ms 1024 KB
subtask2_06.txt RE 180 ms 1024 KB
subtask2_07.txt RE 176 ms 1024 KB
subtask2_08.txt RE 183 ms 1024 KB
subtask2_09.txt RE 177 ms 1024 KB
subtask2_10.txt RE 179 ms 1024 KB
subtask2_11.txt RE 184 ms 1024 KB
subtask2_12.txt RE 184 ms 1024 KB
subtask2_13.txt RE 180 ms 1024 KB
subtask2_14.txt RE 180 ms 1024 KB
subtask2_15.txt RE 178 ms 1024 KB
subtask2_16.txt RE 179 ms 1024 KB
subtask2_17.txt RE 180 ms 1024 KB
subtask2_18.txt RE 180 ms 1024 KB
subtask2_19.txt RE 180 ms 1024 KB
subtask2_20.txt RE 179 ms 1024 KB
subtask2_21.txt RE 176 ms 1024 KB
subtask2_22.txt RE 178 ms 1024 KB
subtask2_23.txt RE 177 ms 1024 KB
subtask2_24.txt RE 177 ms 1024 KB
subtask2_25.txt RE 181 ms 1024 KB