Submission #3979385
Source Code Expand
#include<iostream> #include<algorithm> #include<vector> #include<string> #include<cmath> #include<map> #include<stack> #include<queue> #include<bitset> #define ipair pair<int,int> #define rep(i,n) for(i=0;i<n;i++) using namespace std; typedef long long int lli; typedef vector<int> vi; int main() { int n, i, j, k, m, a, b; vi x; k = 1000000 + 2; x.resize(k); cin >> n; rep(i, n) { cin >> a >> b; x[a]++; x[b + 1]--; } m = x[0]; rep(i, k - 1) { x[i + 1] += x[i]; m = max(m, x[i + 1]); } cout << m << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | kuromegane |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 591 Byte |
Status | AC |
Exec Time | 69 ms |
Memory | 4224 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 | 4 ms | 4096 KB |
subtask0_sample02.txt | AC | 4 ms | 4096 KB |
subtask1_01.txt | AC | 4 ms | 4096 KB |
subtask1_02.txt | AC | 4 ms | 4096 KB |
subtask1_03.txt | AC | 5 ms | 4096 KB |
subtask1_04.txt | AC | 5 ms | 4096 KB |
subtask1_05.txt | AC | 5 ms | 4096 KB |
subtask1_06.txt | AC | 5 ms | 4224 KB |
subtask1_07.txt | AC | 5 ms | 4096 KB |
subtask1_08.txt | AC | 5 ms | 4096 KB |
subtask1_09.txt | AC | 5 ms | 4096 KB |
subtask1_10.txt | AC | 5 ms | 4096 KB |
subtask1_11.txt | AC | 5 ms | 4096 KB |
subtask1_12.txt | AC | 5 ms | 4096 KB |
subtask1_13.txt | AC | 5 ms | 4096 KB |
subtask1_14.txt | AC | 5 ms | 4096 KB |
subtask1_15.txt | AC | 5 ms | 4096 KB |
subtask2_01.txt | AC | 54 ms | 4096 KB |
subtask2_02.txt | AC | 64 ms | 4096 KB |
subtask2_03.txt | AC | 51 ms | 4096 KB |
subtask2_04.txt | AC | 61 ms | 4096 KB |
subtask2_05.txt | AC | 58 ms | 4096 KB |
subtask2_06.txt | AC | 64 ms | 4096 KB |
subtask2_07.txt | AC | 66 ms | 4096 KB |
subtask2_08.txt | AC | 65 ms | 4096 KB |
subtask2_09.txt | AC | 66 ms | 4096 KB |
subtask2_10.txt | AC | 64 ms | 4096 KB |
subtask2_11.txt | AC | 65 ms | 4096 KB |
subtask2_12.txt | AC | 69 ms | 4096 KB |
subtask2_13.txt | AC | 66 ms | 4096 KB |
subtask2_14.txt | AC | 64 ms | 4096 KB |
subtask2_15.txt | AC | 64 ms | 4096 KB |
subtask2_16.txt | AC | 64 ms | 4096 KB |
subtask2_17.txt | AC | 65 ms | 4096 KB |
subtask2_18.txt | AC | 67 ms | 4096 KB |
subtask2_19.txt | AC | 64 ms | 4096 KB |
subtask2_20.txt | AC | 66 ms | 4096 KB |
subtask2_21.txt | AC | 64 ms | 4096 KB |
subtask2_22.txt | AC | 65 ms | 4096 KB |
subtask2_23.txt | AC | 65 ms | 4096 KB |
subtask2_24.txt | AC | 64 ms | 4096 KB |
subtask2_25.txt | AC | 67 ms | 4096 KB |