Submission #4018116
Source Code Expand
#include <iostream> #include <string> #include <algorithm> #include <functional> #include <vector> #include <utility> #include <cstring> #include <iomanip> #include <numeric> #include <cmath> #include <queue> #include <map> using namespace std; typedef long long ll; const int INF = 1<<30; const int MOD = 1e9 + 7; const int dy[] = {1, 0, -1, 0}; const int dx[] = {0, 1, 0, -1}; const int MAX_N = 1000100; int main() { cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; ll color[MAX_N] = {}; for(int i = 0; i < n; i++) { int a, b; cin >> a >> b; color[a]++; color[b + 1]--; } ll ans = -1; for(int i = 1; i < MAX_N; i++) { color[i] += color[i - 1]; ans = max(color[i], ans); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | Shimejime |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 851 Byte |
Status | WA |
Exec Time | 24 ms |
Memory | 8064 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 | 6 ms | 8064 KB |
subtask0_sample02.txt | AC | 6 ms | 8064 KB |
subtask1_01.txt | AC | 6 ms | 8064 KB |
subtask1_02.txt | WA | 6 ms | 8064 KB |
subtask1_03.txt | AC | 7 ms | 8064 KB |
subtask1_04.txt | AC | 6 ms | 8064 KB |
subtask1_05.txt | AC | 6 ms | 8064 KB |
subtask1_06.txt | AC | 6 ms | 8064 KB |
subtask1_07.txt | AC | 6 ms | 8064 KB |
subtask1_08.txt | AC | 6 ms | 8064 KB |
subtask1_09.txt | AC | 6 ms | 8064 KB |
subtask1_10.txt | AC | 7 ms | 8064 KB |
subtask1_11.txt | AC | 7 ms | 8064 KB |
subtask1_12.txt | AC | 6 ms | 8064 KB |
subtask1_13.txt | AC | 6 ms | 8064 KB |
subtask1_14.txt | AC | 7 ms | 8064 KB |
subtask1_15.txt | AC | 7 ms | 8064 KB |
subtask2_01.txt | AC | 21 ms | 8064 KB |
subtask2_02.txt | AC | 22 ms | 8064 KB |
subtask2_03.txt | AC | 20 ms | 8064 KB |
subtask2_04.txt | AC | 22 ms | 8064 KB |
subtask2_05.txt | AC | 21 ms | 8064 KB |
subtask2_06.txt | AC | 23 ms | 8064 KB |
subtask2_07.txt | AC | 24 ms | 8064 KB |
subtask2_08.txt | AC | 23 ms | 8064 KB |
subtask2_09.txt | AC | 24 ms | 8064 KB |
subtask2_10.txt | AC | 24 ms | 8064 KB |
subtask2_11.txt | AC | 23 ms | 8064 KB |
subtask2_12.txt | AC | 24 ms | 8064 KB |
subtask2_13.txt | AC | 24 ms | 8064 KB |
subtask2_14.txt | AC | 23 ms | 8064 KB |
subtask2_15.txt | AC | 24 ms | 8064 KB |
subtask2_16.txt | AC | 23 ms | 8064 KB |
subtask2_17.txt | AC | 23 ms | 8064 KB |
subtask2_18.txt | AC | 24 ms | 8064 KB |
subtask2_19.txt | AC | 23 ms | 8064 KB |
subtask2_20.txt | AC | 23 ms | 8064 KB |
subtask2_21.txt | AC | 23 ms | 8064 KB |
subtask2_22.txt | AC | 23 ms | 8064 KB |
subtask2_23.txt | AC | 23 ms | 8064 KB |
subtask2_24.txt | AC | 24 ms | 8064 KB |
subtask2_25.txt | AC | 23 ms | 8064 KB |