oj.uz

Submission #776590

# Submission time Handle Problem Language Result Execution time Memory
776590 2023-07-08T04:57:02 Z bachhoangxuan Long Mansion (JOI17_long_mansion) C++17
100 / 100
 245 ms 52484 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]);
                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]);
                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 9 ms 12244 KB Output is correct
2 Correct 8 ms 12340 KB Output is correct
3 Correct 9 ms 12448 KB Output is correct
4 Correct 8 ms 12220 KB Output is correct
5 Correct 10 ms 12188 KB Output is correct
6 Correct 9 ms 12220 KB Output is correct
7 Correct 9 ms 12244 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12244 KB Output is correct
2 Correct 8 ms 12340 KB Output is correct
3 Correct 9 ms 12448 KB Output is correct
4 Correct 8 ms 12220 KB Output is correct
5 Correct 10 ms 12188 KB Output is correct
6 Correct 9 ms 12220 KB Output is correct
7 Correct 9 ms 12244 KB Output is correct
8 Correct 91 ms 18104 KB Output is correct
9 Correct 98 ms 18132 KB Output is correct
10 Correct 90 ms 18364 KB Output is correct
11 Correct 80 ms 18736 KB Output is correct
12 Correct 97 ms 17640 KB Output is correct
13 Correct 80 ms 18220 KB Output is correct
14 Correct 80 ms 18268 KB Output is correct
15 Correct 100 ms 18248 KB Output is correct
16 Correct 77 ms 18020 KB Output is correct
17 Correct 78 ms 18192 KB Output is correct
18 Correct 99 ms 18252 KB Output is correct
19 Correct 81 ms 18252 KB Output is correct
20 Correct 78 ms 18296 KB Output is correct
21 Correct 80 ms 18028 KB Output is correct
22 Correct 78 ms 18140 KB Output is correct
23 Correct 94 ms 17996 KB Output is correct
24 Correct 79 ms 17996 KB Output is correct
25 Correct 81 ms 17980 KB Output is correct
26 Correct 95 ms 18088 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 26532 KB Output is correct
2 Correct 131 ms 26412 KB Output is correct
3 Correct 161 ms 26272 KB Output is correct
4 Correct 134 ms 26572 KB Output is correct
5 Correct 158 ms 26512 KB Output is correct
6 Correct 117 ms 25812 KB Output is correct
7 Correct 121 ms 25684 KB Output is correct
8 Correct 119 ms 25520 KB Output is correct
9 Correct 121 ms 25576 KB Output is correct
10 Correct 119 ms 25560 KB Output is correct
11 Correct 123 ms 25584 KB Output is correct

Subtask #4
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12244 KB Output is correct
2 Correct 8 ms 12340 KB Output is correct
3 Correct 9 ms 12448 KB Output is correct
4 Correct 8 ms 12220 KB Output is correct
5 Correct 10 ms 12188 KB Output is correct
6 Correct 9 ms 12220 KB Output is correct
7 Correct 9 ms 12244 KB Output is correct
8 Correct 91 ms 18104 KB Output is correct
9 Correct 98 ms 18132 KB Output is correct
10 Correct 90 ms 18364 KB Output is correct
11 Correct 80 ms 18736 KB Output is correct
12 Correct 97 ms 17640 KB Output is correct
13 Correct 80 ms 18220 KB Output is correct
14 Correct 80 ms 18268 KB Output is correct
15 Correct 100 ms 18248 KB Output is correct
16 Correct 77 ms 18020 KB Output is correct
17 Correct 78 ms 18192 KB Output is correct
18 Correct 99 ms 18252 KB Output is correct
19 Correct 81 ms 18252 KB Output is correct
20 Correct 78 ms 18296 KB Output is correct
21 Correct 80 ms 18028 KB Output is correct
22 Correct 78 ms 18140 KB Output is correct
23 Correct 94 ms 17996 KB Output is correct
24 Correct 79 ms 17996 KB Output is correct
25 Correct 81 ms 17980 KB Output is correct
26 Correct 95 ms 18088 KB Output is correct
27 Correct 132 ms 26532 KB Output is correct
28 Correct 131 ms 26412 KB Output is correct
29 Correct 161 ms 26272 KB Output is correct
30 Correct 134 ms 26572 KB Output is correct
31 Correct 158 ms 26512 KB Output is correct
32 Correct 117 ms 25812 KB Output is correct
33 Correct 121 ms 25684 KB Output is correct
34 Correct 119 ms 25520 KB Output is correct
35 Correct 121 ms 25576 KB Output is correct
36 Correct 119 ms 25560 KB Output is correct
37 Correct 123 ms 25584 KB Output is correct
38 Correct 197 ms 47136 KB Output is correct
39 Correct 244 ms 52484 KB Output is correct
40 Correct 176 ms 40516 KB Output is correct
41 Correct 245 ms 50780 KB Output is correct
42 Correct 112 ms 26764 KB Output is correct
43 Correct 136 ms 26804 KB Output is correct
44 Correct 156 ms 34788 KB Output is correct
45 Correct 184 ms 34892 KB Output is correct
46 Correct 154 ms 35096 KB Output is correct
47 Correct 120 ms 26700 KB Output is correct
48 Correct 113 ms 26496 KB Output is correct
49 Correct 154 ms 34876 KB Output is correct
50 Correct 150 ms 34860 KB Output is correct
51 Correct 175 ms 35160 KB Output is correct
52 Correct 142 ms 33704 KB Output is correct
53 Correct 169 ms 40984 KB Output is correct
54 Correct 218 ms 48020 KB Output is correct
55 Correct 181 ms 41072 KB Output is correct