bzoj 5288: [Hnoi2018]游戏

Description

Solution

#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int n,a
,L
,R
,m,Q,p
;
inline void solve(int x){
int l=x,r=x;
while(1){
if(l>1 && ((l<=a[l-1] && a[l-1]<=r) || !a[l-1])){
l--;
l=min(l,L[l]);r=max(r,R[l]);
continue;
}
if(r<n && ((l<=a[r] && a[r]<=r) || !a[r])){
r++;
l=min(l,L[r]);r=max(r,R[r]);
continue;
}
break;
}
L[x]=l;R[x]=r;
}
int main(){
freopen("game.in","r",stdin);
freopen("game.out","w",stdout);
srand(19260859);
int x,y;
cin>>n>>m>>Q;
for(int i=1;i<=m;i++)
scanf("%d%d",&x,&y),a[x]=y;
for(int i=1;i<=n;i++)L[i]=n+1;
for(int i=1;i<=n;i++)p[i]=i;
for(int i=1;i<=5;i++)random_shuffle(p+1,p+n+1);
for(int i=1;i<=n;i++)solve(p[i]);
while(Q--){
scanf("%d%d",&x,&y);
if(L[x]<=y && y<=R[x])puts("YES");
else puts("NO");
}
return 0;
}