Submission #1770681
Source Code Expand
#include <iostream> #include <string> #include <algorithm> #include <map> #include <set> #include <vector> #include <cmath> #define MOD 1000000007; #define PI = 3.14159265358979323846; using namespace std; long long a[1000001]; long long b[1000001]; long long S[1000001]; int main() { int n; cin >> n; for (long long i = 0; i < 1000001; i++) { S[i] = 0; } long long maxB = 0; for (long long i = 0; i < n; i++) { cin >> a[i] >> b[i]; S[a[i]]++; S[b[i] + 1]--; if (maxB < b[i]) { maxB = b[i]; } } long long max = S[0]; for (long long i = 0; i < maxB; i++) { S[i + 1] = S[i] + S[i + 1]; if (max < S[i + 1]) { max = S[i + 1]; } } cout << max << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | butanokakuni |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 743 Byte |
Status | AC |
Exec Time | 74 ms |
Memory | 14592 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 | 10496 KB |
subtask0_sample02.txt | AC | 5 ms | 10496 KB |
subtask1_01.txt | AC | 4 ms | 10496 KB |
subtask1_02.txt | AC | 4 ms | 10496 KB |
subtask1_03.txt | AC | 6 ms | 10496 KB |
subtask1_04.txt | AC | 6 ms | 10496 KB |
subtask1_05.txt | AC | 6 ms | 10496 KB |
subtask1_06.txt | AC | 6 ms | 10496 KB |
subtask1_07.txt | AC | 5 ms | 10496 KB |
subtask1_08.txt | AC | 6 ms | 10496 KB |
subtask1_09.txt | AC | 6 ms | 10496 KB |
subtask1_10.txt | AC | 6 ms | 10496 KB |
subtask1_11.txt | AC | 6 ms | 10496 KB |
subtask1_12.txt | AC | 6 ms | 10496 KB |
subtask1_13.txt | AC | 6 ms | 10496 KB |
subtask1_14.txt | AC | 6 ms | 10496 KB |
subtask1_15.txt | AC | 6 ms | 10496 KB |
subtask2_01.txt | AC | 55 ms | 14592 KB |
subtask2_02.txt | AC | 65 ms | 14592 KB |
subtask2_03.txt | AC | 53 ms | 14592 KB |
subtask2_04.txt | AC | 63 ms | 14592 KB |
subtask2_05.txt | AC | 58 ms | 14592 KB |
subtask2_06.txt | AC | 67 ms | 14592 KB |
subtask2_07.txt | AC | 65 ms | 14592 KB |
subtask2_08.txt | AC | 66 ms | 14592 KB |
subtask2_09.txt | AC | 68 ms | 14592 KB |
subtask2_10.txt | AC | 65 ms | 14592 KB |
subtask2_11.txt | AC | 66 ms | 14592 KB |
subtask2_12.txt | AC | 66 ms | 14592 KB |
subtask2_13.txt | AC | 65 ms | 14592 KB |
subtask2_14.txt | AC | 66 ms | 14592 KB |
subtask2_15.txt | AC | 65 ms | 14592 KB |
subtask2_16.txt | AC | 65 ms | 14592 KB |
subtask2_17.txt | AC | 66 ms | 14592 KB |
subtask2_18.txt | AC | 65 ms | 14592 KB |
subtask2_19.txt | AC | 66 ms | 14592 KB |
subtask2_20.txt | AC | 65 ms | 14592 KB |
subtask2_21.txt | AC | 65 ms | 14592 KB |
subtask2_22.txt | AC | 69 ms | 14592 KB |
subtask2_23.txt | AC | 68 ms | 14592 KB |
subtask2_24.txt | AC | 74 ms | 14592 KB |
subtask2_25.txt | AC | 66 ms | 14592 KB |