제출 #632502

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
632502		zaneyu	Long Mansion (JOI17_long_mansion)	C++14	100 / 100	343 ms	56440 KiB

long_mansion

/*input
5
1 2 3 4
2 2 3
1 1
1 1
1 3
1 4
4
2 4
4 2
1 5
5 3

*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<ll,ll>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET(v,x) lower_bound(ALL(v),x)-v.begin()
const ll maxn=5e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1.0l);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"\n");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
vector<int> v[maxn];
int arr[maxn];
int lst[maxn],nxt[maxn],pv[maxn],l[maxn],r[maxn];
int seg[4*maxn];
void build(int idx,int l,int r){
    if(l==r){
        seg[idx]=pv[l];
        return;
    }
    int mid=(l+r)/2;
    build(idx*2,l,mid),build(idx*2+1,mid+1,r);
    seg[idx]=min(seg[idx*2],seg[idx*2+1]);
}
int get(int idx,int l,int r,int ql,int qr,int x){
    if(r<ql or l>qr or seg[idx]>=x) return -1;
    //cout<<idx<<' '<<l<<' '<<r<<'\n';
    if(l==r) return l;
    int mid=(l+r)/2;
    int res=get(idx*2,l,mid,ql,qr,x);
    if(res!=-1) return res;
    return get(idx*2+1,mid+1,r,ql,qr,x);
}
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n;
    cin>>n;
    REP1(i,n-1) cin>>arr[i];
    REP1(i,n){
        int k;
        cin>>k;
        while(k--){
            int x;
            cin>>x;
            v[i].pb(x);
        }
    }
    REP1(i,n){
        pv[i]=lst[arr[i-1]];
        for(int x:v[i]) lst[x]=i;
    }
    REP(i,n+1) lst[i]=n+1;
    for(int i=n;i>=1;i--){
        nxt[i]=lst[arr[i]];
        for(int x:v[i]) lst[x]=i;
    }
    nxt[0]=n+1;
    build(1,1,n+1);
    REP1(i,n){
        l[i]=r[i]=i;
        while(true){
            int nr=get(1,1,n+1,r[i]+1,n+1,l[i])-1;
            int nl=(nxt[l[i]-1]<=nr?l[l[i]-1]:l[i]);
            if(nl==l[i] and nr==r[i]) break;
            l[i]=nl,r[i]=nr;
        }
    }
    int q;
    cin>>q;
    while(q--){
        int a,b;
        cin>>a>>b;
        if(l[a]<=b and b<=r[a]) cout<<"YES\n";
        else cout<<"NO\n";
    }
}   

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 15 / 15
• Subtask 4: 75 / 75