이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mx=500020;
int c[mx];
ll b[mx];
vector<ll>keys[mx];
ll mxright[mx];
ll mxleft[mx];
ll n,m;
int leftt[mx];int rightt[mx];
int last[mx];
int canr(int i){
if(leftt[c[i]]>=mxleft[i]&&leftt[c[i]]!=-1&&mxright[i]<n){
return 1;
}return 0;
}int canl(int i){
if(rightt[c[i-1]]<=mxright[i]&&rightt[c[i]]!=-1&&mxleft[i]>1){
return 1;
}return 0;
}
int main()
{
cin>>n;
for(ll i=1;i<n;i++){
cin>>c[i];
}
for(ll i=1;i<=n;i++){
cin>>b[i];
for(ll j=0;j<b[i];j++){
ll x;
cin>>x;
keys[i].push_back(x);
}
}
memset(last ,-1 ,sizeof last);
for(int i=1;i<n;i++){
for(int j:keys[i]){
last[j]=i;
}
leftt[c[i]]=last[c[i]];
}
memset(last ,-1 ,sizeof last);
for(int i=n-1;i>=1;i--){
for(int j:keys[i+1]){
last[j]=i+1;
}
rightt[c[i]]=last[c[i]];
}
for(ll i=1;i<=n;i++){
ll myr=i;
ll myl=i; mxleft[i]=i; mxright[i]=i;
while(1){
ll xx=0;ll xo=0;
if(canr(i)){
xx=1;
myr++;
mxright[i]=myr;
}
if(canl(i)){
xo=1;
myl--; mxleft[i]=myl;
mxleft[i]=min(mxleft[i],mxleft[mxleft[i]]);
mxright[i]=max(mxright[i],mxright[mxleft[i]]);
}
if(xo||xx){
}else{
break;
}
} //mxleft[i]=myl;mxright[i]=myr;
// cout<<myl<<" "<<myr<<endl;
//return 0;
}//cout<<mxright[1];
ll q;cin>>q;
for(ll i=0;i<q;i++){
ll x,y;cin>>x>>y;
//cout<<mxleft[x]<<" "<<mxright[x];
if(mxleft[x]<=y&&y<=mxright[x]){
cout<<"YES";
}else{cout<<"NO";}
cout<<endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |