oj.uz

Submission #848591

# Submission time Handle Problem Language Result Execution time Memory
848591 2023-09-13T01:58:38 Z dungz Long Mansion (JOI17_long_mansion) C++17
100 / 100
 239 ms 50204 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
//#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
///const int inf=1e18;
const int mod=1e9+7;
const int maxn=500005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
/*
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
*/
const int base=101;
int n,lt[maxn],rt[maxn],c[maxn],sl[maxn],sr[maxn];
vector<int> a[maxn];
int p[maxn];
void solve(){
    cin >> n;
    for(int i=1;i<n;i++) cin >> c[i];
    for(int i=1;i<=n;i++){
        int sz;cin >> sz;a[i].resize(sz);
        for(int j=0;j<sz;j++) cin >> a[i][j];
    }
    for(int i=1;i<n;i++){
        for(int x:a[i]) p[x]=i;
        sl[i]=p[c[i]];
    }
    for(int i=1;i<=n;i++) p[i]=n+1;
    for(int i=n;i>=2;i--){
        for(int x:a[i]) p[x]=i;
        sr[i-1]=p[c[i-1]];
    }
    function<void(int,int)> dnc = [&](int l,int r){
        if(l==r){lt[l]=rt[l]=l;return;}
        int mid=(l+r)>>1;
        dnc(l,mid);dnc(mid+1,r);
        int cl=mid,cr=mid;
        for(int i=mid;i>=l;i--){
            if(rt[i]==mid){
                cl=min(cl,lt[i]);
                // cl=lt[i];
                while(true){
                    if(cr<r && sl[cr]>=cl) cr++;
                    else if(cl>l && sr[cl-1]<=cr) cl--;
                    else break;
                }
                lt[i]=cl,rt[i]=cr;   
             }
        }
        cl=mid+1,cr=mid+1;
        for(int i=mid+1;i<=r;i++){
            if(lt[i]==mid+1){
                cr=max(cr,rt[i]);
                // cr=rt[i];
                while(true){
                    if(cr<r && sl[cr]>=cl) cr++;
                    else if(cl>l && sr[cl-1]<=cr) cl--;
                    else break;
                }
                lt[i]=cl,rt[i]=cr;
            }
        }
    };
    dnc(1,n);
    int q;cin >> q;
    for(int i=1;i<=q;i++){
        int x,y;cin >> x >> y;
        cout << (lt[x]<=y && y<=rt[x]?"YES":"NO") << '\n';
    }
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 23132 KB Output is correct
2 Correct 5 ms 23132 KB Output is correct
3 Correct 6 ms 23132 KB Output is correct
4 Correct 5 ms 23168 KB Output is correct
5 Correct 5 ms 23128 KB Output is correct
6 Correct 6 ms 23216 KB Output is correct
7 Correct 6 ms 23144 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 23132 KB Output is correct
2 Correct 5 ms 23132 KB Output is correct
3 Correct 6 ms 23132 KB Output is correct
4 Correct 5 ms 23168 KB Output is correct
5 Correct 5 ms 23128 KB Output is correct
6 Correct 6 ms 23216 KB Output is correct
7 Correct 6 ms 23144 KB Output is correct
8 Correct 85 ms 27104 KB Output is correct
9 Correct 80 ms 27024 KB Output is correct
10 Correct 77 ms 27160 KB Output is correct
11 Correct 82 ms 27476 KB Output is correct
12 Correct 75 ms 26712 KB Output is correct
13 Correct 78 ms 27220 KB Output is correct
14 Correct 73 ms 27220 KB Output is correct
15 Correct 75 ms 27216 KB Output is correct
16 Correct 77 ms 27392 KB Output is correct
17 Correct 76 ms 27144 KB Output is correct
18 Correct 76 ms 27384 KB Output is correct
19 Correct 75 ms 27308 KB Output is correct
20 Correct 79 ms 27220 KB Output is correct
21 Correct 75 ms 27220 KB Output is correct
22 Correct 77 ms 26964 KB Output is correct
23 Correct 77 ms 26960 KB Output is correct
24 Correct 80 ms 26916 KB Output is correct
25 Correct 77 ms 26768 KB Output is correct
26 Correct 77 ms 26868 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 31996 KB Output is correct
2 Correct 123 ms 31824 KB Output is correct
3 Correct 122 ms 31868 KB Output is correct
4 Correct 132 ms 32084 KB Output is correct
5 Correct 124 ms 31820 KB Output is correct
6 Correct 109 ms 31576 KB Output is correct
7 Correct 108 ms 31568 KB Output is correct
8 Correct 106 ms 31576 KB Output is correct
9 Correct 105 ms 31572 KB Output is correct
10 Correct 108 ms 31416 KB Output is correct
11 Correct 110 ms 31540 KB Output is correct

Subtask #4
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 23132 KB Output is correct
2 Correct 5 ms 23132 KB Output is correct
3 Correct 6 ms 23132 KB Output is correct
4 Correct 5 ms 23168 KB Output is correct
5 Correct 5 ms 23128 KB Output is correct
6 Correct 6 ms 23216 KB Output is correct
7 Correct 6 ms 23144 KB Output is correct
8 Correct 85 ms 27104 KB Output is correct
9 Correct 80 ms 27024 KB Output is correct
10 Correct 77 ms 27160 KB Output is correct
11 Correct 82 ms 27476 KB Output is correct
12 Correct 75 ms 26712 KB Output is correct
13 Correct 78 ms 27220 KB Output is correct
14 Correct 73 ms 27220 KB Output is correct
15 Correct 75 ms 27216 KB Output is correct
16 Correct 77 ms 27392 KB Output is correct
17 Correct 76 ms 27144 KB Output is correct
18 Correct 76 ms 27384 KB Output is correct
19 Correct 75 ms 27308 KB Output is correct
20 Correct 79 ms 27220 KB Output is correct
21 Correct 75 ms 27220 KB Output is correct
22 Correct 77 ms 26964 KB Output is correct
23 Correct 77 ms 26960 KB Output is correct
24 Correct 80 ms 26916 KB Output is correct
25 Correct 77 ms 26768 KB Output is correct
26 Correct 77 ms 26868 KB Output is correct
27 Correct 123 ms 31996 KB Output is correct
28 Correct 123 ms 31824 KB Output is correct
29 Correct 122 ms 31868 KB Output is correct
30 Correct 132 ms 32084 KB Output is correct
31 Correct 124 ms 31820 KB Output is correct
32 Correct 109 ms 31576 KB Output is correct
33 Correct 108 ms 31568 KB Output is correct
34 Correct 106 ms 31576 KB Output is correct
35 Correct 105 ms 31572 KB Output is correct
36 Correct 108 ms 31416 KB Output is correct
37 Correct 110 ms 31540 KB Output is correct
38 Correct 179 ms 43492 KB Output is correct
39 Correct 192 ms 46944 KB Output is correct
40 Correct 167 ms 39508 KB Output is correct
41 Correct 239 ms 46444 KB Output is correct
42 Correct 107 ms 31932 KB Output is correct
43 Correct 107 ms 32008 KB Output is correct
44 Correct 142 ms 36432 KB Output is correct
45 Correct 143 ms 36448 KB Output is correct
46 Correct 145 ms 36432 KB Output is correct
47 Correct 107 ms 31744 KB Output is correct
48 Correct 111 ms 32080 KB Output is correct
49 Correct 141 ms 31252 KB Output is correct
50 Correct 144 ms 31144 KB Output is correct
51 Correct 148 ms 31020 KB Output is correct
52 Correct 135 ms 31020 KB Output is correct
53 Correct 163 ms 40276 KB Output is correct
54 Correct 188 ms 50204 KB Output is correct
55 Correct 159 ms 45040 KB Output is correct