Submission #1231920
Source Code Expand
#include <vector> #include <iostream> #include <utility> #include <algorithm> #include <string> #include <deque> #include <queue> #include <tuple> #include <queue> #include <functional> #include <cmath> #include <iomanip> #include <map> #include <set> #include <numeric> #include <unordered_map> #include <unordered_set> #include <complex> #include <iterator> #include <array> #include <memory> #include <stack> #define vi vector<int> #define vvi vector<vector<int> > #define ll long long int #define vl vector<ll> #define vvl vector<vector<ll>> #define vb vector<bool> #define vc vector<char> #define vs vector<string> #define ld long double #define INF 1e9 #define EPS 0.0000000001 #define rep(i,n) for(int i=0;i<n;i++) #define loop(i,s,n) for(int i=s;i<n;i++) #define all(in) in.begin(), in.end() template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; } template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; } #define MAX 1e6 using namespace std; typedef pair<int, int> pii; typedef pair<double,double>pdd; typedef pair<ll,ll>pll; int main(){ int n; cin>>n; vi v(MAX+8,0); rep(i,n){ pii t; cin>>t.first>>t.second; v[t.first]++; v[t.second+1]--; } rep(i,MAX+8)if(i)v[i]+=v[i-1]; int ans=0; rep(i,MAX+8)cmax(ans,v[i]); cout<<ans<<endl; //rep(i,n+1)cout<<v[i]<<" "; }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | yebityon |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1437 Byte |
Status | AC |
Exec Time | 74 ms |
Memory | 4096 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 | 6 ms | 4096 KB |
subtask0_sample02.txt | AC | 6 ms | 4096 KB |
subtask1_01.txt | AC | 6 ms | 4096 KB |
subtask1_02.txt | AC | 6 ms | 4096 KB |
subtask1_03.txt | AC | 7 ms | 4096 KB |
subtask1_04.txt | AC | 7 ms | 4096 KB |
subtask1_05.txt | AC | 7 ms | 4096 KB |
subtask1_06.txt | AC | 7 ms | 4096 KB |
subtask1_07.txt | AC | 7 ms | 4096 KB |
subtask1_08.txt | AC | 7 ms | 4096 KB |
subtask1_09.txt | AC | 8 ms | 4096 KB |
subtask1_10.txt | AC | 8 ms | 4096 KB |
subtask1_11.txt | AC | 7 ms | 4096 KB |
subtask1_12.txt | AC | 7 ms | 4096 KB |
subtask1_13.txt | AC | 8 ms | 4096 KB |
subtask1_14.txt | AC | 8 ms | 4096 KB |
subtask1_15.txt | AC | 8 ms | 4096 KB |
subtask2_01.txt | AC | 56 ms | 4096 KB |
subtask2_02.txt | AC | 67 ms | 4096 KB |
subtask2_03.txt | AC | 55 ms | 4096 KB |
subtask2_04.txt | AC | 64 ms | 4096 KB |
subtask2_05.txt | AC | 61 ms | 4096 KB |
subtask2_06.txt | AC | 66 ms | 4096 KB |
subtask2_07.txt | AC | 66 ms | 4096 KB |
subtask2_08.txt | AC | 67 ms | 4096 KB |
subtask2_09.txt | AC | 66 ms | 4096 KB |
subtask2_10.txt | AC | 67 ms | 4096 KB |
subtask2_11.txt | AC | 67 ms | 4096 KB |
subtask2_12.txt | AC | 74 ms | 4096 KB |
subtask2_13.txt | AC | 67 ms | 4096 KB |
subtask2_14.txt | AC | 66 ms | 4096 KB |
subtask2_15.txt | AC | 67 ms | 4096 KB |
subtask2_16.txt | AC | 66 ms | 4096 KB |
subtask2_17.txt | AC | 67 ms | 4096 KB |
subtask2_18.txt | AC | 67 ms | 4096 KB |
subtask2_19.txt | AC | 69 ms | 4096 KB |
subtask2_20.txt | AC | 66 ms | 4096 KB |
subtask2_21.txt | AC | 67 ms | 4096 KB |
subtask2_22.txt | AC | 71 ms | 4096 KB |
subtask2_23.txt | AC | 68 ms | 4096 KB |
subtask2_24.txt | AC | 67 ms | 4096 KB |
subtask2_25.txt | AC | 67 ms | 4096 KB |