Submission #1226815
Source Code Expand
#define _GLIBCXX_IOSTREAM
#include<bits/stdc++.h>
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;
#define xx first
#define yy second
template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b){return a<b?a:b;}
template<typename T> inline T abs(T a){return a>0?a:-a;}
template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
template<typename T> inline T sqr(T x){return x*x;}
#define mp(a,b) std::make_pair(a,b)
#define pb push_back
#define I inline
#define mset(a,b) memset(a,b,sizeof(a))
#define mcpy(a,b) memcpy(a,b,sizeof(a))
#define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
#define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
#define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define fd0(i,n) for(int i=(n)-1;~i;i--)
#define fd1(i,n) for(int i=n;i;i--)
#define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define foe(i,x)for(__typeof(x.end())i=x.begin();i!=x.end();++i)
struct Cg{I char operator()(){return getchar();}};
struct Cp{I void operator()(char x){putchar(x);}};
#define OP operator
#define RT return *this;
#define RX x=0;char t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
#define RU x=0;char t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define TR *this,x;return x;
I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int &x)
{RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char &x)
{for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char *x){char t=P();for(;IS(t);t=P());if(~t){for(;!IS
(t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf &x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf &x){RX;RL;RT}I OP llf()
{llf x;TR}I Fr&OP,(uint &x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull &x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
#define WI(S) if(x){if(x<0)P('-'),x=-x;char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
#define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)\
x=-x;while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
#define WU(S) if(x){char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}I Fw&OP()
(ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char *x){while(*x)P(*x++);RT}
I Fw&OP()(const char *x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;
const int N=100007;
int n,a[N],b[N],c[N],v[N*3],vm,p[N*3],sf[N*3],sp[N*3],f[N*3];
inline int get(int x)
{
return std::lower_bound(v,v+vm,x)-v+1;
}
struct Q
{
int l,r;
inline bool operator<(const Q&x)const
{
return l>x.l||(l==x.l&&r<x.r);
}
};
struct cmp
{
inline bool operator()(const Q&a,const Q&b)const
{
return a.r<b.r;
}
};
std::vector<int>q[N*3];
std::priority_queue<Q>pq;
std::priority_queue<Q,std::vector<Q>,cmp>q2;
int main()
{
in,n;
fo1(i,n)in,a[i],b[i];
fo1(i,n+1)in,c[i];
fo1(i,n)v[vm++]=a[i];
fo1(i,n)v[vm++]=b[i];
fo1(i,n+1)v[vm++]=c[i];
std::sort(v,v+vm);
vm=std::unique(v,v+vm)-v;
fo1(i,n)a[i]=get(a[i]);
fo1(i,n)b[i]=get(b[i]);
fo1(i,n+1)c[i]=get(c[i]);
//fo1(i,n)out,a[i],' ',b[i],'\n';
//fo1(i,n+1)out,c[i],' ';out,'\n';
fo1(i,n)p[a[i]]++;
fo1(i,n+1)p[c[i]]--;
fo1(i,vm)p[i]+=p[i-1];
//fo1(i,vm)out,p[i],' ';out,'\n';
//fo1(i,n)if(a[i]>b[i])
// out,b[i],' ',a[i]-1,'\n';
fo1(i,n)if(a[i]>b[i])
q[a[i]-1].pb(b[i]);
int del=0,cnt=0;
fd1(i,vm)
{
foe(j,q[i])pq.push((Q){*j,i});
q[i].clear();
p[i]+=del+=sp[i];
while(p[i]<-1)
{
if(pq.empty())goto yjq;
Q s=pq.top();pq.pop();
while(s.l>i)
{
q[s.l].pb(s.r);
if(pq.empty())goto yjq;
s=pq.top();
pq.pop();
}
sp[s.l-1]--;
sf[i+1]++;
sf[s.r+1]--;
del++;
p[i]++;
cnt++;
}
}
//out,cnt,'\n';
while(!pq.empty())q[pq.top().l].pb(pq.top().r),pq.pop();
del=0;
fo1(i,vm)
{
p[i]+=del+=sf[i];
foe(j,q[i])q2.push((Q){i,*j});
f[i]=cnt;
//out,'|',p[i],'\n';
if(p[i]==-1)
{
Q s=(Q){0,0};
while(!q2.empty()&&s.r<i)s=q2.top(),q2.pop();
if(s.r<i)cnt=19260817;
else
{
//out,i,' ',s.l,' ',s.r,'\n';
del++;
sf[s.r+1]--;
cnt++;
}
}
}
f[vm+1]=19260817;
for(int m=in;m--;)
{
int x,y;
in,x,y;
x=get(x),y=get(y);
int a=max(n-f[x]+1,n-f[y]);
if(a<0)out,"-1\n";else out,a,'\n';
}
return 0;yjq:
for(int m=in;m--;)out,"-1\n";
}
Submission Info
Submission Time |
|
Task |
F - Two Faced Cards |
User |
mcfx |
Language |
C++14 (GCC 5.4.1) |
Score |
2000 |
Code Size |
5306 Byte |
Status |
AC |
Exec Time |
183 ms |
Memory |
21748 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
2000 / 2000 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt, subtask_1_39.txt, subtask_1_40.txt, subtask_1_41.txt, subtask_1_42.txt, subtask_1_43.txt, subtask_1_44.txt, subtask_1_45.txt, subtask_1_46.txt, subtask_1_47.txt, subtask_1_48.txt, subtask_1_49.txt, subtask_1_50.txt, subtask_1_51.txt, subtask_1_52.txt, subtask_1_53.txt, subtask_1_54.txt, subtask_1_55.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
4 ms |
12544 KB |
sample_02.txt |
AC |
4 ms |
12544 KB |
sample_03.txt |
AC |
4 ms |
12544 KB |
subtask_1_01.txt |
AC |
71 ms |
15872 KB |
subtask_1_02.txt |
AC |
86 ms |
16376 KB |
subtask_1_03.txt |
AC |
38 ms |
14208 KB |
subtask_1_04.txt |
AC |
81 ms |
17268 KB |
subtask_1_05.txt |
AC |
50 ms |
14840 KB |
subtask_1_06.txt |
AC |
118 ms |
17532 KB |
subtask_1_07.txt |
AC |
95 ms |
17280 KB |
subtask_1_08.txt |
AC |
113 ms |
18040 KB |
subtask_1_09.txt |
AC |
118 ms |
19700 KB |
subtask_1_10.txt |
AC |
72 ms |
16248 KB |
subtask_1_11.txt |
AC |
50 ms |
14848 KB |
subtask_1_12.txt |
AC |
59 ms |
14972 KB |
subtask_1_13.txt |
AC |
87 ms |
16632 KB |
subtask_1_14.txt |
AC |
54 ms |
15224 KB |
subtask_1_15.txt |
AC |
75 ms |
16128 KB |
subtask_1_16.txt |
AC |
34 ms |
13568 KB |
subtask_1_17.txt |
AC |
174 ms |
21624 KB |
subtask_1_18.txt |
AC |
45 ms |
15100 KB |
subtask_1_19.txt |
AC |
60 ms |
15488 KB |
subtask_1_20.txt |
AC |
121 ms |
17916 KB |
subtask_1_21.txt |
AC |
166 ms |
18808 KB |
subtask_1_22.txt |
AC |
168 ms |
20340 KB |
subtask_1_23.txt |
AC |
166 ms |
18808 KB |
subtask_1_24.txt |
AC |
167 ms |
20340 KB |
subtask_1_25.txt |
AC |
181 ms |
21748 KB |
subtask_1_26.txt |
AC |
172 ms |
20084 KB |
subtask_1_27.txt |
AC |
100 ms |
17664 KB |
subtask_1_28.txt |
AC |
157 ms |
18804 KB |
subtask_1_29.txt |
AC |
180 ms |
21748 KB |
subtask_1_30.txt |
AC |
169 ms |
20080 KB |
subtask_1_31.txt |
AC |
101 ms |
17664 KB |
subtask_1_32.txt |
AC |
155 ms |
18804 KB |
subtask_1_33.txt |
AC |
183 ms |
21748 KB |
subtask_1_34.txt |
AC |
169 ms |
20084 KB |
subtask_1_35.txt |
AC |
101 ms |
17664 KB |
subtask_1_36.txt |
AC |
157 ms |
18804 KB |
subtask_1_37.txt |
AC |
181 ms |
21748 KB |
subtask_1_38.txt |
AC |
168 ms |
20084 KB |
subtask_1_39.txt |
AC |
101 ms |
17664 KB |
subtask_1_40.txt |
AC |
158 ms |
18804 KB |
subtask_1_41.txt |
AC |
101 ms |
16376 KB |
subtask_1_42.txt |
AC |
88 ms |
15360 KB |
subtask_1_43.txt |
AC |
113 ms |
17524 KB |
subtask_1_44.txt |
AC |
89 ms |
15232 KB |
subtask_1_45.txt |
AC |
61 ms |
14848 KB |
subtask_1_46.txt |
AC |
82 ms |
16252 KB |
subtask_1_47.txt |
AC |
69 ms |
14976 KB |
subtask_1_48.txt |
AC |
91 ms |
17144 KB |
subtask_1_49.txt |
AC |
71 ms |
14976 KB |
subtask_1_50.txt |
AC |
49 ms |
14720 KB |
subtask_1_51.txt |
AC |
5 ms |
12544 KB |
subtask_1_52.txt |
AC |
5 ms |
12544 KB |
subtask_1_53.txt |
AC |
5 ms |
12544 KB |
subtask_1_54.txt |
AC |
5 ms |
12544 KB |
subtask_1_55.txt |
AC |
5 ms |
12544 KB |