Submission #1624818
Source Code Expand
#include <iostream> #include <algorithm> #include <array> #include <math.h> #include <set> #include <stdlib.h> #include <string> #include <vector> #define INT_MAX 2000000000 #define MOD 1000000007 #define ll long long #define rep(i,a,b) for(i = (a); i < (b); i++) #define bitget(a,b) (((a) >> (b)) & 1) using namespace std; int i, j, k; int main() { int n; cin >> n; int a[100000], b[100000]; rep(i, 0, n) cin >> a[i] >> b[i]; int c[1000002] = {}; rep(i, 0, n) { c[a[i]]++; c[b[i]+1]--; } int m = 0; rep(i, 1, 1000001) { c[i] += c[i - 1]; if (c[i] > m) { m = c[i]; } } cout << m << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | noshi91 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 669 Byte |
Status | WA |
Exec Time | 85 ms |
Memory | 4992 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 | 4 ms | 4608 KB |
subtask0_sample02.txt | AC | 5 ms | 4096 KB |
subtask1_01.txt | AC | 5 ms | 4096 KB |
subtask1_02.txt | WA | 5 ms | 4096 KB |
subtask1_03.txt | AC | 6 ms | 4864 KB |
subtask1_04.txt | AC | 6 ms | 4224 KB |
subtask1_05.txt | AC | 6 ms | 4224 KB |
subtask1_06.txt | AC | 6 ms | 4352 KB |
subtask1_07.txt | AC | 6 ms | 4224 KB |
subtask1_08.txt | AC | 6 ms | 4224 KB |
subtask1_09.txt | AC | 6 ms | 4224 KB |
subtask1_10.txt | AC | 6 ms | 4224 KB |
subtask1_11.txt | AC | 6 ms | 4864 KB |
subtask1_12.txt | AC | 6 ms | 4224 KB |
subtask1_13.txt | AC | 6 ms | 4224 KB |
subtask1_14.txt | AC | 6 ms | 4352 KB |
subtask1_15.txt | AC | 6 ms | 4224 KB |
subtask2_01.txt | AC | 71 ms | 4992 KB |
subtask2_02.txt | AC | 84 ms | 4992 KB |
subtask2_03.txt | AC | 64 ms | 4864 KB |
subtask2_04.txt | AC | 79 ms | 4992 KB |
subtask2_05.txt | AC | 75 ms | 4992 KB |
subtask2_06.txt | AC | 83 ms | 4992 KB |
subtask2_07.txt | AC | 85 ms | 4864 KB |
subtask2_08.txt | AC | 83 ms | 4992 KB |
subtask2_09.txt | AC | 84 ms | 4992 KB |
subtask2_10.txt | AC | 83 ms | 4864 KB |
subtask2_11.txt | AC | 84 ms | 4864 KB |
subtask2_12.txt | AC | 83 ms | 4992 KB |
subtask2_13.txt | AC | 84 ms | 4992 KB |
subtask2_14.txt | AC | 83 ms | 4992 KB |
subtask2_15.txt | AC | 85 ms | 4864 KB |
subtask2_16.txt | AC | 83 ms | 4864 KB |
subtask2_17.txt | AC | 84 ms | 4864 KB |
subtask2_18.txt | AC | 83 ms | 4992 KB |
subtask2_19.txt | AC | 84 ms | 4992 KB |
subtask2_20.txt | AC | 83 ms | 4992 KB |
subtask2_21.txt | AC | 85 ms | 4992 KB |
subtask2_22.txt | AC | 84 ms | 4992 KB |
subtask2_23.txt | AC | 85 ms | 4992 KB |
subtask2_24.txt | AC | 83 ms | 4992 KB |
subtask2_25.txt | AC | 85 ms | 4864 KB |