oj.uz

Submission #632502

# Submission time Handle Problem Language Result Execution time Memory
632502 2022-08-20T08:14:04 Z zaneyu Long Mansion (JOI17_long_mansion) C++14
100 / 100
 343 ms 56440 KB 
/*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.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12244 KB Output is correct
2 Correct 9 ms 12388 KB Output is correct
3 Correct 9 ms 12472 KB Output is correct
4 Correct 9 ms 12244 KB Output is correct
5 Correct 8 ms 12244 KB Output is correct
6 Correct 9 ms 12240 KB Output is correct
7 Correct 8 ms 12244 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12244 KB Output is correct
2 Correct 9 ms 12388 KB Output is correct
3 Correct 9 ms 12472 KB Output is correct
4 Correct 9 ms 12244 KB Output is correct
5 Correct 8 ms 12244 KB Output is correct
6 Correct 9 ms 12240 KB Output is correct
7 Correct 8 ms 12244 KB Output is correct
8 Correct 86 ms 18040 KB Output is correct
9 Correct 89 ms 18024 KB Output is correct
10 Correct 98 ms 18444 KB Output is correct
11 Correct 104 ms 18868 KB Output is correct
12 Correct 79 ms 17740 KB Output is correct
13 Correct 84 ms 18320 KB Output is correct
14 Correct 89 ms 18360 KB Output is correct
15 Correct 105 ms 18276 KB Output is correct
16 Correct 94 ms 18096 KB Output is correct
17 Correct 84 ms 18220 KB Output is correct
18 Correct 92 ms 18380 KB Output is correct
19 Correct 100 ms 18316 KB Output is correct
20 Correct 85 ms 18260 KB Output is correct
21 Correct 81 ms 18044 KB Output is correct
22 Correct 85 ms 18148 KB Output is correct
23 Correct 85 ms 18084 KB Output is correct
24 Correct 121 ms 18020 KB Output is correct
25 Correct 88 ms 18072 KB Output is correct
26 Correct 97 ms 18096 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 28320 KB Output is correct
2 Correct 170 ms 28064 KB Output is correct
3 Correct 212 ms 27844 KB Output is correct
4 Correct 174 ms 28104 KB Output is correct
5 Correct 183 ms 28192 KB Output is correct
6 Correct 174 ms 26844 KB Output is correct
7 Correct 152 ms 26564 KB Output is correct
8 Correct 152 ms 26744 KB Output is correct
9 Correct 177 ms 26544 KB Output is correct
10 Correct 153 ms 26524 KB Output is correct
11 Correct 149 ms 26544 KB Output is correct

Subtask #4
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12244 KB Output is correct
2 Correct 9 ms 12388 KB Output is correct
3 Correct 9 ms 12472 KB Output is correct
4 Correct 9 ms 12244 KB Output is correct
5 Correct 8 ms 12244 KB Output is correct
6 Correct 9 ms 12240 KB Output is correct
7 Correct 8 ms 12244 KB Output is correct
8 Correct 86 ms 18040 KB Output is correct
9 Correct 89 ms 18024 KB Output is correct
10 Correct 98 ms 18444 KB Output is correct
11 Correct 104 ms 18868 KB Output is correct
12 Correct 79 ms 17740 KB Output is correct
13 Correct 84 ms 18320 KB Output is correct
14 Correct 89 ms 18360 KB Output is correct
15 Correct 105 ms 18276 KB Output is correct
16 Correct 94 ms 18096 KB Output is correct
17 Correct 84 ms 18220 KB Output is correct
18 Correct 92 ms 18380 KB Output is correct
19 Correct 100 ms 18316 KB Output is correct
20 Correct 85 ms 18260 KB Output is correct
21 Correct 81 ms 18044 KB Output is correct
22 Correct 85 ms 18148 KB Output is correct
23 Correct 85 ms 18084 KB Output is correct
24 Correct 121 ms 18020 KB Output is correct
25 Correct 88 ms 18072 KB Output is correct
26 Correct 97 ms 18096 KB Output is correct
27 Correct 183 ms 28320 KB Output is correct
28 Correct 170 ms 28064 KB Output is correct
29 Correct 212 ms 27844 KB Output is correct
30 Correct 174 ms 28104 KB Output is correct
31 Correct 183 ms 28192 KB Output is correct
32 Correct 174 ms 26844 KB Output is correct
33 Correct 152 ms 26564 KB Output is correct
34 Correct 152 ms 26744 KB Output is correct
35 Correct 177 ms 26544 KB Output is correct
36 Correct 153 ms 26524 KB Output is correct
37 Correct 149 ms 26544 KB Output is correct
38 Correct 313 ms 51188 KB Output is correct
39 Correct 279 ms 56440 KB Output is correct
40 Correct 283 ms 44620 KB Output is correct
41 Correct 343 ms 54844 KB Output is correct
42 Correct 153 ms 27784 KB Output is correct
43 Correct 169 ms 27828 KB Output is correct
44 Correct 217 ms 36976 KB Output is correct
45 Correct 248 ms 37148 KB Output is correct
46 Correct 223 ms 37176 KB Output is correct
47 Correct 179 ms 27856 KB Output is correct
48 Correct 153 ms 27612 KB Output is correct
49 Correct 278 ms 36932 KB Output is correct
50 Correct 229 ms 36912 KB Output is correct
51 Correct 239 ms 37256 KB Output is correct
52 Correct 202 ms 35784 KB Output is correct
53 Correct 263 ms 45132 KB Output is correct
54 Correct 311 ms 52216 KB Output is correct
55 Correct 240 ms 45280 KB Output is correct