Submission #230433
Source Code Expand
#include <iostream> #include <vector> int main() { using std::cout; using std::endl; using std::cin; const int MAX = 1000001; int number; int a, b; int max = 0; int now = 0; std::vector<int> list(MAX, 0); cin >> number; for (int i = 0; i < number; i++) { cin >> a >> b; list[a]++; if (b < MAX - 1) { list[b + 1]--; } } for (int i = 0; i < MAX; i++) { now += list[i]; if (max < now) { max = now; } } cout << max << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | fujihiro |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 510 Byte |
Status | AC |
Exec Time | 154 ms |
Memory | 4772 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 | 33 ms | 4760 KB |
subtask0_sample02.txt | AC | 31 ms | 4644 KB |
subtask1_01.txt | AC | 32 ms | 4576 KB |
subtask1_02.txt | AC | 32 ms | 4772 KB |
subtask1_03.txt | AC | 34 ms | 4640 KB |
subtask1_04.txt | AC | 35 ms | 4640 KB |
subtask1_05.txt | AC | 34 ms | 4648 KB |
subtask1_06.txt | AC | 33 ms | 4636 KB |
subtask1_07.txt | AC | 34 ms | 4648 KB |
subtask1_08.txt | AC | 35 ms | 4708 KB |
subtask1_09.txt | AC | 33 ms | 4644 KB |
subtask1_10.txt | AC | 34 ms | 4640 KB |
subtask1_11.txt | AC | 34 ms | 4648 KB |
subtask1_12.txt | AC | 33 ms | 4764 KB |
subtask1_13.txt | AC | 35 ms | 4576 KB |
subtask1_14.txt | AC | 33 ms | 4644 KB |
subtask1_15.txt | AC | 34 ms | 4764 KB |
subtask2_01.txt | AC | 126 ms | 4636 KB |
subtask2_02.txt | AC | 147 ms | 4640 KB |
subtask2_03.txt | AC | 124 ms | 4644 KB |
subtask2_04.txt | AC | 143 ms | 4636 KB |
subtask2_05.txt | AC | 135 ms | 4640 KB |
subtask2_06.txt | AC | 148 ms | 4764 KB |
subtask2_07.txt | AC | 146 ms | 4764 KB |
subtask2_08.txt | AC | 148 ms | 4712 KB |
subtask2_09.txt | AC | 147 ms | 4760 KB |
subtask2_10.txt | AC | 148 ms | 4764 KB |
subtask2_11.txt | AC | 149 ms | 4632 KB |
subtask2_12.txt | AC | 152 ms | 4648 KB |
subtask2_13.txt | AC | 152 ms | 4636 KB |
subtask2_14.txt | AC | 150 ms | 4640 KB |
subtask2_15.txt | AC | 152 ms | 4700 KB |
subtask2_16.txt | AC | 154 ms | 4644 KB |
subtask2_17.txt | AC | 150 ms | 4704 KB |
subtask2_18.txt | AC | 149 ms | 4640 KB |
subtask2_19.txt | AC | 152 ms | 4648 KB |
subtask2_20.txt | AC | 150 ms | 4768 KB |
subtask2_21.txt | AC | 146 ms | 4644 KB |
subtask2_22.txt | AC | 152 ms | 4684 KB |
subtask2_23.txt | AC | 149 ms | 4640 KB |
subtask2_24.txt | AC | 148 ms | 4772 KB |
subtask2_25.txt | AC | 149 ms | 4636 KB |