Submission #4642920
Source Code Expand
#include<cstdio> #include<algorithm> using namespace std; int a,b,l[1000001]={},r[1000002]={},sum[1000001],n,ans=0; int main(){ scanf("%d",&n); for(int i=0;i<n;i++){ scanf("%d %d",&a,&b); l[a]++; r[b+1]++; } sum[0]=l[0]; ans=sum[0]; for(int i=1;i<=1000000;i++){ sum[i]=sum[i-1]+l[i]-r[i]; ans=max(sum[i],ans); } printf("%d\n",ans); }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | AC961009 |
Language | C++14 (Clang 3.8.0) |
Score | 100 |
Code Size | 423 Byte |
Status | AC |
Exec Time | 26 ms |
Memory | 12032 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
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 | 7 ms | 8184 KB |
subtask0_sample02.txt | AC | 4 ms | 7936 KB |
subtask1_01.txt | AC | 4 ms | 7936 KB |
subtask1_02.txt | AC | 4 ms | 7936 KB |
subtask1_03.txt | AC | 4 ms | 5888 KB |
subtask1_04.txt | AC | 4 ms | 5888 KB |
subtask1_05.txt | AC | 4 ms | 5888 KB |
subtask1_06.txt | AC | 4 ms | 5888 KB |
subtask1_07.txt | AC | 4 ms | 7936 KB |
subtask1_08.txt | AC | 5 ms | 11904 KB |
subtask1_09.txt | AC | 5 ms | 11904 KB |
subtask1_10.txt | AC | 6 ms | 11904 KB |
subtask1_11.txt | AC | 5 ms | 11904 KB |
subtask1_12.txt | AC | 5 ms | 11776 KB |
subtask1_13.txt | AC | 5 ms | 11904 KB |
subtask1_14.txt | AC | 5 ms | 11904 KB |
subtask1_15.txt | AC | 5 ms | 11904 KB |
subtask2_01.txt | AC | 20 ms | 5888 KB |
subtask2_02.txt | AC | 22 ms | 6272 KB |
subtask2_03.txt | AC | 19 ms | 5888 KB |
subtask2_04.txt | AC | 21 ms | 6272 KB |
subtask2_05.txt | AC | 21 ms | 10368 KB |
subtask2_06.txt | AC | 25 ms | 12032 KB |
subtask2_07.txt | AC | 24 ms | 12032 KB |
subtask2_08.txt | AC | 24 ms | 12032 KB |
subtask2_09.txt | AC | 24 ms | 12032 KB |
subtask2_10.txt | AC | 26 ms | 12032 KB |
subtask2_11.txt | AC | 24 ms | 12032 KB |
subtask2_12.txt | AC | 24 ms | 12032 KB |
subtask2_13.txt | AC | 24 ms | 12032 KB |
subtask2_14.txt | AC | 24 ms | 12032 KB |
subtask2_15.txt | AC | 24 ms | 12032 KB |
subtask2_16.txt | AC | 24 ms | 12032 KB |
subtask2_17.txt | AC | 24 ms | 12032 KB |
subtask2_18.txt | AC | 25 ms | 12032 KB |
subtask2_19.txt | AC | 24 ms | 12032 KB |
subtask2_20.txt | AC | 23 ms | 12032 KB |
subtask2_21.txt | AC | 23 ms | 12032 KB |
subtask2_22.txt | AC | 23 ms | 12032 KB |
subtask2_23.txt | AC | 23 ms | 12032 KB |
subtask2_24.txt | AC | 23 ms | 12032 KB |
subtask2_25.txt | AC | 23 ms | 12032 KB |