Submission #2179981
Source Code Expand
#include <bits/stdc++.h>
#define rep(i,n) for(long long int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(long long int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(long long int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define P pair<int,int>
#define Abs(a,b) max(a,b)-min(a,b)
#define YES(condition) if(condition){cout << "YES" << endl;}else{cout << "NO" << endl;}
#define Yes(condition) if(condition){cout << "Yes" << endl;}else{cout << "No" << endl;}
#define Cout(x) cout<<(x)<<endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE" ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible" ) << endl
#define possible(n) cout << ((n) ? "possible" : "impossible" ) << endl
#define Size(n) (n).size()
typedef long long ll;
using namespace std;
const int INF = 1e9,MOD = 1e9 + 7;
const ll LINF = 1e18;
//long long int kaizyo(long long int hh){
// cmp=1;
//while(hh>1){
// cmp=(cmp*hh)%MOD;
//hh--;
//}
//return cmp;
//}
//long long int ruizyo(long long int aa, long long int bb){
// if(aa==0){
// return 1;
//}
//else if(aa%2==0){
// long long int tt=ruizyo(aa/2,bb);
//return (tt*tt)%MOD;
//}
//else{
// return (ruizyo(aa-1,bb)*bb)%MOD;
//}
//}フェルマ-のア
//while(x!=0){
//sum+=x%10;
// x/=10;
//}
//各桁の和
//pair<int,int> p[100000];
//P r[100000];
//cin >> tmp;
//p[i]=make_pair(tmp,i);
//cout << p[i].second+1 << endl;//ペアの右側つまりiを出力
//s.find(w[i])==string::npos
//findの使い方
//for(int i=0;i<n;i++){
// b[i]=x%2;
//x/=2;
//}二進数
//visited=vector<vector<bool>>(10,vector<bool>(10,false));アを全部falseに
long long int n,cnt=0,ans=0,a,b,c,cmp,cmpp,m,h,w,x,y,sum=0,pos,imos[10000000];
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
string alph("abcdefghijklmnopqrstuvwxyz"),s;
bool fl=true;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
rep(i,n){
cin>>a>>b;
imos[a]++;
imos[b+1]--;
}
rrep(i,1,10000000){
imos[i]=imos[i]+imos[i-1];
//Cout(imos[i]);
}
sort(imos,imos+10000000);
reverse(imos,imos+10000000);
Cout(imos[0]);
return 0;
}
Submission Info
Submission Time |
|
Task |
C - AtColor |
User |
asdf1 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
2433 Byte |
Status |
AC |
Exec Time |
311 ms |
Memory |
78464 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 |
213 ms |
78336 KB |
subtask0_sample02.txt |
AC |
216 ms |
78336 KB |
subtask1_01.txt |
AC |
213 ms |
78336 KB |
subtask1_02.txt |
AC |
213 ms |
78336 KB |
subtask1_03.txt |
AC |
217 ms |
78464 KB |
subtask1_04.txt |
AC |
217 ms |
78336 KB |
subtask1_05.txt |
AC |
217 ms |
78336 KB |
subtask1_06.txt |
AC |
220 ms |
78336 KB |
subtask1_07.txt |
AC |
214 ms |
78336 KB |
subtask1_08.txt |
AC |
243 ms |
78336 KB |
subtask1_09.txt |
AC |
226 ms |
78336 KB |
subtask1_10.txt |
AC |
228 ms |
78336 KB |
subtask1_11.txt |
AC |
229 ms |
78336 KB |
subtask1_12.txt |
AC |
246 ms |
78336 KB |
subtask1_13.txt |
AC |
225 ms |
78336 KB |
subtask1_14.txt |
AC |
254 ms |
78336 KB |
subtask1_15.txt |
AC |
225 ms |
78336 KB |
subtask2_01.txt |
AC |
230 ms |
78336 KB |
subtask2_02.txt |
AC |
239 ms |
78336 KB |
subtask2_03.txt |
AC |
228 ms |
78336 KB |
subtask2_04.txt |
AC |
249 ms |
78336 KB |
subtask2_05.txt |
AC |
228 ms |
78336 KB |
subtask2_06.txt |
AC |
306 ms |
78336 KB |
subtask2_07.txt |
AC |
306 ms |
78336 KB |
subtask2_08.txt |
AC |
303 ms |
78336 KB |
subtask2_09.txt |
AC |
307 ms |
78336 KB |
subtask2_10.txt |
AC |
274 ms |
78336 KB |
subtask2_11.txt |
AC |
307 ms |
78336 KB |
subtask2_12.txt |
AC |
285 ms |
78336 KB |
subtask2_13.txt |
AC |
303 ms |
78336 KB |
subtask2_14.txt |
AC |
304 ms |
78336 KB |
subtask2_15.txt |
AC |
307 ms |
78336 KB |
subtask2_16.txt |
AC |
302 ms |
78336 KB |
subtask2_17.txt |
AC |
311 ms |
78336 KB |
subtask2_18.txt |
AC |
268 ms |
78336 KB |
subtask2_19.txt |
AC |
308 ms |
78336 KB |
subtask2_20.txt |
AC |
276 ms |
78336 KB |
subtask2_21.txt |
AC |
277 ms |
78336 KB |
subtask2_22.txt |
AC |
268 ms |
78336 KB |
subtask2_23.txt |
AC |
307 ms |
78336 KB |
subtask2_24.txt |
AC |
277 ms |
78336 KB |
subtask2_25.txt |
AC |
308 ms |
78336 KB |