Submission #1662771
Source Code Expand
#include<iostream> #include<string> #include<string.h> #include<algorithm> #include<stdio.h> #include<cmath> #include<vector> #include<utility> #include<stack> #include<queue> #include<list> #define FOR(i, a, b) for(int i=(a);i<=(b);i++) #define RFOR(i, a, b) for(int i=(a);i>=(b);i--) #define MOD 1000000007 #define INF 1000000001; using namespace std; int main(void) { int n; int a, b; cin >> n; vector<int>count(1000001, 0); FOR(i, 1, n) { cin >> a >> b; FOR(t, a, b) { count[t]++; } } sort(count.begin(), count.end()); cout << count[1000000] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | yukiteru |
Language | C++14 (GCC 5.4.1) |
Score | 30 |
Code Size | 626 Byte |
Status | TLE |
Exec Time | 3159 ms |
Memory | 4096 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 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 | 17 ms | 4096 KB |
subtask0_sample02.txt | AC | 17 ms | 4096 KB |
subtask1_01.txt | AC | 16 ms | 4096 KB |
subtask1_02.txt | AC | 16 ms | 4096 KB |
subtask1_03.txt | AC | 1065 ms | 4096 KB |
subtask1_04.txt | AC | 1065 ms | 4096 KB |
subtask1_05.txt | AC | 1064 ms | 4096 KB |
subtask1_06.txt | AC | 1067 ms | 4096 KB |
subtask1_07.txt | AC | 18 ms | 4096 KB |
subtask1_08.txt | AC | 372 ms | 4096 KB |
subtask1_09.txt | AC | 375 ms | 4096 KB |
subtask1_10.txt | AC | 375 ms | 4096 KB |
subtask1_11.txt | AC | 391 ms | 4096 KB |
subtask1_12.txt | AC | 367 ms | 4096 KB |
subtask1_13.txt | AC | 377 ms | 4096 KB |
subtask1_14.txt | AC | 371 ms | 4096 KB |
subtask1_15.txt | AC | 380 ms | 4096 KB |
subtask2_01.txt | TLE | 3155 ms | 4096 KB |
subtask2_02.txt | TLE | 3155 ms | 4096 KB |
subtask2_03.txt | TLE | 3155 ms | 4096 KB |
subtask2_04.txt | TLE | 3155 ms | 4096 KB |
subtask2_05.txt | AC | 72 ms | 4096 KB |
subtask2_06.txt | TLE | 3155 ms | 4096 KB |
subtask2_07.txt | TLE | 3155 ms | 4096 KB |
subtask2_08.txt | TLE | 3155 ms | 4096 KB |
subtask2_09.txt | TLE | 3155 ms | 4096 KB |
subtask2_10.txt | TLE | 3155 ms | 4096 KB |
subtask2_11.txt | TLE | 3155 ms | 4096 KB |
subtask2_12.txt | TLE | 3155 ms | 4096 KB |
subtask2_13.txt | TLE | 3155 ms | 4096 KB |
subtask2_14.txt | TLE | 3155 ms | 4096 KB |
subtask2_15.txt | TLE | 3155 ms | 4096 KB |
subtask2_16.txt | TLE | 3159 ms | 4096 KB |
subtask2_17.txt | TLE | 3155 ms | 4096 KB |
subtask2_18.txt | TLE | 3155 ms | 4096 KB |
subtask2_19.txt | TLE | 3155 ms | 4096 KB |
subtask2_20.txt | TLE | 3155 ms | 4096 KB |
subtask2_21.txt | TLE | 3155 ms | 4096 KB |
subtask2_22.txt | TLE | 3155 ms | 4096 KB |
subtask2_23.txt | TLE | 3155 ms | 4096 KB |
subtask2_24.txt | TLE | 3155 ms | 4096 KB |
subtask2_25.txt | TLE | 3155 ms | 4096 KB |