Submission #1589061
Source Code Expand
#include<iostream> #include<string> #include<string.h> #include<algorithm> #include<stdio.h> #include<cmath> #include<vector> #define FOR(i, a, b) for(int i=(a);i<=(b);i++) #define RFOR(i, a, b) for(int i=(a);i>=(b);i--) using namespace std; int main(void) { int n; int *a, *b; int count[1000001] = {}; int maxi; cin >> n; a = new int[n + 1]; b = new int[n + 1]; FOR(i, 1, n) { cin >> a[i] >> b[i]; FOR(t, a[i], b[i]) { count[t]++; } } maxi = count[0]; cout << maxi << endl; FOR(i, 1, n) { maxi = max(maxi, count[i]); cout << maxi << endl; } cout << maxi << endl; delete[] a; delete[] b; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | yukiteru |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 667 Byte |
Status | WA |
Exec Time | 3155 ms |
Memory | 5120 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 | WA | 2 ms | 4096 KB |
subtask0_sample02.txt | WA | 3 ms | 4096 KB |
subtask1_01.txt | WA | 2 ms | 4096 KB |
subtask1_02.txt | WA | 2 ms | 4096 KB |
subtask1_03.txt | WA | 1404 ms | 4224 KB |
subtask1_04.txt | WA | 1402 ms | 4224 KB |
subtask1_05.txt | WA | 1402 ms | 4224 KB |
subtask1_06.txt | WA | 1401 ms | 4224 KB |
subtask1_07.txt | WA | 7 ms | 4224 KB |
subtask1_08.txt | WA | 476 ms | 4224 KB |
subtask1_09.txt | WA | 474 ms | 4224 KB |
subtask1_10.txt | WA | 470 ms | 4224 KB |
subtask1_11.txt | WA | 483 ms | 4224 KB |
subtask1_12.txt | WA | 464 ms | 4224 KB |
subtask1_13.txt | WA | 477 ms | 4224 KB |
subtask1_14.txt | WA | 462 ms | 4224 KB |
subtask1_15.txt | WA | 473 ms | 4224 KB |
subtask2_01.txt | TLE | 3155 ms | 4224 KB |
subtask2_02.txt | TLE | 3155 ms | 4224 KB |
subtask2_03.txt | TLE | 3155 ms | 4224 KB |
subtask2_04.txt | TLE | 3155 ms | 4224 KB |
subtask2_05.txt | WA | 226 ms | 5120 KB |
subtask2_06.txt | TLE | 3155 ms | 4224 KB |
subtask2_07.txt | TLE | 3155 ms | 4224 KB |
subtask2_08.txt | TLE | 3155 ms | 4224 KB |
subtask2_09.txt | TLE | 3155 ms | 4224 KB |
subtask2_10.txt | TLE | 3155 ms | 4224 KB |
subtask2_11.txt | TLE | 3155 ms | 4224 KB |
subtask2_12.txt | TLE | 3155 ms | 4224 KB |
subtask2_13.txt | TLE | 3155 ms | 4224 KB |
subtask2_14.txt | TLE | 3155 ms | 4224 KB |
subtask2_15.txt | TLE | 3155 ms | 4224 KB |
subtask2_16.txt | TLE | 3155 ms | 4224 KB |
subtask2_17.txt | TLE | 3155 ms | 4224 KB |
subtask2_18.txt | TLE | 3155 ms | 4224 KB |
subtask2_19.txt | TLE | 3155 ms | 4224 KB |
subtask2_20.txt | TLE | 3155 ms | 4224 KB |
subtask2_21.txt | TLE | 3155 ms | 4224 KB |
subtask2_22.txt | TLE | 3155 ms | 4224 KB |
subtask2_23.txt | TLE | 3155 ms | 4224 KB |
subtask2_24.txt | TLE | 3155 ms | 4224 KB |
subtask2_25.txt | TLE | 3155 ms | 4224 KB |