Submission #2233083
Source Code Expand
#include <algorithm> #include <iostream> #include <vector> using namespace std; int main() { int n; cin >> n; vector<int> count(100000 + 2, 0); for (int i = 0; i < n; ++i) { int a, b; cin >> a >> b; ++count[a]; --count[b + 1]; } int ret = count[0]; int v = 0; for (int c : count) { v += c; ret = max(ret, v); } cout << ret << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | peria |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 415 Byte |
Status | RE |
Exec Time | 103 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 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 | 1 ms | 640 KB |
subtask0_sample02.txt | RE | 97 ms | 640 KB |
subtask1_01.txt | AC | 1 ms | 640 KB |
subtask1_02.txt | AC | 1 ms | 640 KB |
subtask1_03.txt | RE | 97 ms | 640 KB |
subtask1_04.txt | RE | 97 ms | 640 KB |
subtask1_05.txt | RE | 97 ms | 640 KB |
subtask1_06.txt | RE | 99 ms | 640 KB |
subtask1_07.txt | AC | 2 ms | 640 KB |
subtask1_08.txt | RE | 97 ms | 640 KB |
subtask1_09.txt | RE | 103 ms | 640 KB |
subtask1_10.txt | RE | 97 ms | 640 KB |
subtask1_11.txt | RE | 96 ms | 640 KB |
subtask1_12.txt | RE | 97 ms | 640 KB |
subtask1_13.txt | RE | 97 ms | 640 KB |
subtask1_14.txt | RE | 99 ms | 640 KB |
subtask1_15.txt | RE | 97 ms | 640 KB |
subtask2_01.txt | RE | 98 ms | 640 KB |
subtask2_02.txt | RE | 97 ms | 640 KB |
subtask2_03.txt | RE | 97 ms | 640 KB |
subtask2_04.txt | RE | 97 ms | 640 KB |
subtask2_05.txt | AC | 56 ms | 640 KB |
subtask2_06.txt | RE | 98 ms | 640 KB |
subtask2_07.txt | RE | 97 ms | 640 KB |
subtask2_08.txt | RE | 97 ms | 640 KB |
subtask2_09.txt | RE | 97 ms | 640 KB |
subtask2_10.txt | RE | 98 ms | 640 KB |
subtask2_11.txt | RE | 98 ms | 640 KB |
subtask2_12.txt | RE | 96 ms | 640 KB |
subtask2_13.txt | RE | 96 ms | 640 KB |
subtask2_14.txt | RE | 99 ms | 640 KB |
subtask2_15.txt | RE | 97 ms | 640 KB |
subtask2_16.txt | RE | 97 ms | 640 KB |
subtask2_17.txt | RE | 97 ms | 640 KB |
subtask2_18.txt | RE | 98 ms | 640 KB |
subtask2_19.txt | RE | 97 ms | 640 KB |
subtask2_20.txt | RE | 97 ms | 640 KB |
subtask2_21.txt | RE | 97 ms | 640 KB |
subtask2_22.txt | RE | 97 ms | 640 KB |
subtask2_23.txt | RE | 96 ms | 640 KB |
subtask2_24.txt | RE | 98 ms | 640 KB |
subtask2_25.txt | RE | 97 ms | 640 KB |