Submission #1176709
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <cstdio> #include <utility> #include <string> #include <sstream> #include <fstream> #include <cmath> #include <stack> #include <queue> #include <list> #include <map> #include <iomanip> #include <set> using namespace std; typedef vector<int> VI; typedef vector<VI> VVI; #define MAX(x,y) ( (x) > (y) ? (x) : (y) ) #define MIN(x, y) ( (x) < (y) ? (x) : (y) ) #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define REP(i,n) FOR(i,0,n) #define IVFOR(p,a) for(vector<int>::iterator p = (a).begin(); p!=(a).end(); p++) #define ILFOR(p,a) for(list<int>::iterator p = (a).begin(); p!=(a).end(); p++) #define ALL(a) (a).begin(),(a).end() #define SORT(c) sort((c).begin(),(c).end()) #define CHECK(x) cout << #x << " = " << (x) << endl #define FINA(y) cout << (y) << endl #define N 1000001 int main(){ long long int n; cin >> n; long long int a, b; long long int v[N]; REP(i,N){ v[i] = 0; } REP(i,n){ cin >> a >> b; for(int j = a; j <= b; j++){ v[j]++; // cout << "v[" << j << "] = " << v[j] << endl; } } int max = 0; int max_c = 0; // FINA("fff"); for(int i = 0; i < N; i++){ if(v[i] > max){ max = v[i]; i = max_c; } } FINA(max); // FINA(max_c); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | Rx17Qq |
Language | C++14 (GCC 5.4.1) |
Score | 30 |
Code Size | 1380 Byte |
Status | TLE |
Exec Time | 3155 ms |
Memory | 8064 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 | 4 ms | 8064 KB |
subtask0_sample02.txt | AC | 6 ms | 8064 KB |
subtask1_01.txt | AC | 4 ms | 8064 KB |
subtask1_02.txt | AC | 4 ms | 8064 KB |
subtask1_03.txt | AC | 1430 ms | 8064 KB |
subtask1_04.txt | AC | 1429 ms | 8064 KB |
subtask1_05.txt | AC | 1440 ms | 8064 KB |
subtask1_06.txt | AC | 1440 ms | 8064 KB |
subtask1_07.txt | AC | 5 ms | 8064 KB |
subtask1_08.txt | AC | 589 ms | 8064 KB |
subtask1_09.txt | AC | 596 ms | 8064 KB |
subtask1_10.txt | AC | 592 ms | 8064 KB |
subtask1_11.txt | AC | 613 ms | 8064 KB |
subtask1_12.txt | AC | 583 ms | 8064 KB |
subtask1_13.txt | AC | 591 ms | 8064 KB |
subtask1_14.txt | AC | 576 ms | 8064 KB |
subtask1_15.txt | AC | 598 ms | 8064 KB |
subtask2_01.txt | TLE | 3155 ms | 8064 KB |
subtask2_02.txt | TLE | 3155 ms | 8064 KB |
subtask2_03.txt | TLE | 3155 ms | 8064 KB |
subtask2_04.txt | TLE | 3155 ms | 8064 KB |
subtask2_05.txt | AC | 58 ms | 8064 KB |
subtask2_06.txt | TLE | 3155 ms | 8064 KB |
subtask2_07.txt | TLE | 3155 ms | 8064 KB |
subtask2_08.txt | TLE | 3155 ms | 8064 KB |
subtask2_09.txt | TLE | 3155 ms | 8064 KB |
subtask2_10.txt | TLE | 3155 ms | 8064 KB |
subtask2_11.txt | TLE | 3155 ms | 8064 KB |
subtask2_12.txt | TLE | 3155 ms | 8064 KB |
subtask2_13.txt | TLE | 3155 ms | 8064 KB |
subtask2_14.txt | TLE | 3155 ms | 8064 KB |
subtask2_15.txt | TLE | 3155 ms | 8064 KB |
subtask2_16.txt | TLE | 3155 ms | 8064 KB |
subtask2_17.txt | TLE | 3155 ms | 8064 KB |
subtask2_18.txt | TLE | 3155 ms | 8064 KB |
subtask2_19.txt | TLE | 3155 ms | 8064 KB |
subtask2_20.txt | TLE | 3155 ms | 8064 KB |
subtask2_21.txt | TLE | 3155 ms | 8064 KB |
subtask2_22.txt | TLE | 3155 ms | 8064 KB |
subtask2_23.txt | TLE | 3155 ms | 8064 KB |
subtask2_24.txt | TLE | 3155 ms | 8064 KB |
subtask2_25.txt | TLE | 3155 ms | 8064 KB |