Submission #697999

#	Time	Username	Problem	Language	Result	Execution time	Memory
697999		urosk	Long Mansion (JOI17_long_mansion)	C++14	100 / 100	2517 ms	209352 KiB

long_mansion

#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include "bits/stdc++.h"
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll long long
#define llinf 100000000000000000LL // 10^17
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) (ll)(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define cer(a) {cerr<<#a<<": ";for(ll x_ : a) cerr<<x_<< " ";cerr<<endl;}

#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);

using namespace std;
//using namespace __gnu_pbds;
/*
ll add(ll x,ll y){
    x+=y;
    if(x<0){
        x%=mod;
        x+=mod;
    }else{
        if(x>=mod) x%=mod;
    }
    return x;
}
ll mul(ll a,ll b){
	ll ans = (a*b)%mod;
	if(ans<0) ans+=mod;
	return ans;
}
typedef tree<int,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<int,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
    return uniform_int_distribution<ll>(l,r)(rng);
}
*/
#define maxn 500005
ll n,q;
ll a[maxn];
ll b[maxn];
set<ll> v[maxn];
set<ll> s[maxn];
ll l[maxn],r[maxn];
ll qx[maxn],qy[maxn];
ll t[2*maxn],ls[2*maxn],rs[2*maxn],root = 0,tsz = 0;
bool ok[maxn];
void upd(ll v,ll tl,ll tr,ll i,ll x){
    if(tl==tr){t[v] = x;return;}
    ll mid = (tl+tr)/2;
    if(i<=mid) upd(ls[v],tl,mid,i,x);
    else upd(rs[v],mid+1,tr,i,x);
    t[v] = min(t[ls[v]],t[rs[v]]);
}
ll get(ll v,ll tl,ll tr,ll l,ll r){
    if(tl>tr||l>tr||r<tl) return llinf;
    if(tl>=l&&tr<=r) return t[v];
    ll mid = (tl+tr)/2;
    return min(get(ls[v],tl,mid,l,r),get(rs[v],mid+1,tr,l,r));
}
void init(ll &v,ll tl,ll tr){
    t[v] = llinf;
    if(!v) v = ++tsz;
    if(tl==tr) return;
    ll mid = (tl+tr)/2;
    init(ls[v],tl,mid);
    init(rs[v],mid+1,tr);
}
bool ans[maxn];
void reshi(bool f){
    init(root,1,n);
    for(ll i = 0;i<=n-1;i++) l[i] = 0;
    for(ll i = 0;i<=n-1;i++) r[i] = n+1;
    /*
    for(ll i = 1;i<=n-1;i++){
        auto it = s[a[i]].lower_bound(i);
        if(it==s[a[i]].end()) continue;
        if((*it)==i){l[i] = r[i] = i;continue;}
        r[i] = (*it);
        if(it!=s[a[i]].begin()){
            it--;
            l[i] = (*it);
        }
    }
    */
    for(ll i = 1;i<=n-1;i++){
        auto it = s[a[i]].upper_bound(i);
        if(it!=s[a[i]].end()) r[i] = (*it);
        if(it!=s[a[i]].begin()){
            it--;
            l[i] = (*it);
        }
    }
    set<pll> st;
    multiset<ll> sl;
    for(ll i = 1;i<=n-1;i++) st.insert({r[i-1],i});
    for(ll i = 1;i<=n-1;i++) sl.insert(i);
    for(ll i = 1;i<=n-1;i++){
        while(sz(st)&&(*st.begin()).fi<=i){
            pll p = (*st.begin());
            ll j = p.sc;
            sl.erase(j);
            st.erase(st.begin());
        }
        auto it = sl.upper_bound(l[i]);
        ll val = llinf;
        if(it!=sl.end()) val = *it;
        upd(root,1,n,i,val);
    }
    for(ll i = 1;i<=q;i++){
        ll x = qx[i],y = qy[i];
        if(x<y&&f) ans[i] = get(root,1,n,x,y-1)>x;
        else if(x>y&&!f){
            x = n-x+1; y = n-y+1;
            ans[i] = get(root,1,n,x,y-1)>x;
        }
    }
}
void tc(){
    cin >> n;
    for(ll i = 1;i<=n-1;i++) cin >> a[i];
    for(ll i = 1;i<=n;i++){
        cin >> b[i];
        for(ll j = 1;j<=b[i];j++){
            ll x; cin >> x;
            v[i].insert(x);
            s[x].insert(i);
        }
    }
    cin >> q;
    for(ll i = 1;i<=q;i++) cin >> qx[i] >> qy[i];
    reshi(1);
    reverse(a+1,a+n);
    reverse(v+1,v+1+n);
    for(ll i = 1;i<=n;i++) s[i].clear();
    for(ll i = 1;i<=n;i++){
        for(ll x : v[i]) s[x].insert(i);
    }
    reshi(0);
    for(ll i = 1;i<=q;i++){
        if(ans[i]) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
}
int main(){
	daj_mi_malo_vremena
    int t; t = 1;
    while(t--){
        tc();
    }
	return 0;
}

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