oj.uz

답안 #848590

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
848590 2023-09-13T01:57:13 Z dungz Long Mansion (JOI17_long_mansion) C++17
25 / 100
 3000 ms 52452 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

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 23128 KB Output is correct
2 Correct 7 ms 23132 KB Output is correct
3 Correct 6 ms 23128 KB Output is correct
4 Correct 5 ms 23128 KB Output is correct
5 Correct 5 ms 23128 KB Output is correct
6 Correct 6 ms 23128 KB Output is correct
7 Correct 5 ms 23040 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 23128 KB Output is correct
2 Correct 7 ms 23132 KB Output is correct
3 Correct 6 ms 23128 KB Output is correct
4 Correct 5 ms 23128 KB Output is correct
5 Correct 5 ms 23128 KB Output is correct
6 Correct 6 ms 23128 KB Output is correct
7 Correct 5 ms 23040 KB Output is correct
8 Correct 93 ms 28852 KB Output is correct
9 Correct 79 ms 28752 KB Output is correct
10 Correct 78 ms 29268 KB Output is correct
11 Correct 79 ms 29520 KB Output is correct
12 Correct 73 ms 28500 KB Output is correct
13 Correct 78 ms 29008 KB Output is correct
14 Correct 81 ms 29132 KB Output is correct
15 Correct 76 ms 29008 KB Output is correct
16 Correct 74 ms 29008 KB Output is correct
17 Correct 77 ms 29004 KB Output is correct
18 Correct 76 ms 29020 KB Output is correct
19 Correct 78 ms 29008 KB Output is correct
20 Correct 77 ms 29008 KB Output is correct
21 Correct 87 ms 29012 KB Output is correct
22 Correct 78 ms 29008 KB Output is correct
23 Correct 75 ms 28924 KB Output is correct
24 Correct 84 ms 28828 KB Output is correct
25 Correct 80 ms 28740 KB Output is correct
26 Correct 79 ms 28752 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 34832 KB Output is correct
2 Correct 124 ms 35152 KB Output is correct
3 Correct 121 ms 34896 KB Output is correct
4 Correct 125 ms 35228 KB Output is correct
5 Correct 128 ms 35236 KB Output is correct
6 Correct 114 ms 34384 KB Output is correct
7 Correct 111 ms 34380 KB Output is correct
8 Correct 109 ms 34128 KB Output is correct
9 Correct 118 ms 34164 KB Output is correct
10 Correct 107 ms 34132 KB Output is correct
11 Correct 113 ms 34376 KB Output is correct

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 23128 KB Output is correct
2 Correct 7 ms 23132 KB Output is correct
3 Correct 6 ms 23128 KB Output is correct
4 Correct 5 ms 23128 KB Output is correct
5 Correct 5 ms 23128 KB Output is correct
6 Correct 6 ms 23128 KB Output is correct
7 Correct 5 ms 23040 KB Output is correct
8 Correct 93 ms 28852 KB Output is correct
9 Correct 79 ms 28752 KB Output is correct
10 Correct 78 ms 29268 KB Output is correct
11 Correct 79 ms 29520 KB Output is correct
12 Correct 73 ms 28500 KB Output is correct
13 Correct 78 ms 29008 KB Output is correct
14 Correct 81 ms 29132 KB Output is correct
15 Correct 76 ms 29008 KB Output is correct
16 Correct 74 ms 29008 KB Output is correct
17 Correct 77 ms 29004 KB Output is correct
18 Correct 76 ms 29020 KB Output is correct
19 Correct 78 ms 29008 KB Output is correct
20 Correct 77 ms 29008 KB Output is correct
21 Correct 87 ms 29012 KB Output is correct
22 Correct 78 ms 29008 KB Output is correct
23 Correct 75 ms 28924 KB Output is correct
24 Correct 84 ms 28828 KB Output is correct
25 Correct 80 ms 28740 KB Output is correct
26 Correct 79 ms 28752 KB Output is correct
27 Correct 133 ms 34832 KB Output is correct
28 Correct 124 ms 35152 KB Output is correct
29 Correct 121 ms 34896 KB Output is correct
30 Correct 125 ms 35228 KB Output is correct
31 Correct 128 ms 35236 KB Output is correct
32 Correct 114 ms 34384 KB Output is correct
33 Correct 111 ms 34380 KB Output is correct
34 Correct 109 ms 34128 KB Output is correct
35 Correct 118 ms 34164 KB Output is correct
36 Correct 107 ms 34132 KB Output is correct
37 Correct 113 ms 34376 KB Output is correct
38 Correct 181 ms 49076 KB Output is correct
39 Correct 192 ms 52452 KB Output is correct
40 Correct 170 ms 44624 KB Output is correct
41 Correct 229 ms 50744 KB Output is correct
42 Correct 108 ms 35396 KB Output is correct
43 Correct 141 ms 35356 KB Output is correct
44 Correct 142 ms 41088 KB Output is correct
45 Correct 143 ms 41344 KB Output is correct
46 Correct 149 ms 41552 KB Output is correct
47 Correct 187 ms 35408 KB Output is correct
48 Correct 247 ms 35576 KB Output is correct
49 Correct 262 ms 38320 KB Output is correct
50 Correct 228 ms 41192 KB Output is correct
51 Correct 152 ms 41420 KB Output is correct
52 Correct 1258 ms 40220 KB Output is correct
53 Execution timed out 3014 ms 37204 KB Time limit exceeded
54 Halted 0 ms 0 KB -