oj.uz

답안 #749790

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
749790 2023-05-28T13:43:39 Z GrindMachine Long Mansion (JOI17_long_mansion) C++17
25 / 100
 490 ms 262144 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://codeforces.com/blog/entry/51010

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    int n; cin >> n;
    vector<int> c(n+5);
    rep1(i,n-1) cin >> c[i];
    
    vector<int> a[n+5];
    rep1(i,n){
        int k; cin >> k;
        rep1(j,k){
            ll x; cin >> x;
            a[i].pb(x);
        }
    }    

    vector<int> left_pos(n+5,-1), right_pos(n+5,-1);
    vector<int> pos(n+5);

    rep1(i,n){
        trav(x,a[i]){
            pos[x] = i;
        }

        left_pos[i] = pos[c[i]];
    }

    fill(all(pos),n+1);

    rev(i,n,1){
        trav(x,a[i]){
            pos[x] = i;
        }

        right_pos[i] = pos[c[i-1]];
    }

    vector<pii> ranges;

    rep1(l,n){
        // find first r s.t [l,r] becomes unextendable
        for(int r = l; r < right_pos[l]; ++r){
            if(left_pos[r] < l){
                ranges.pb({l,r});
            }
        }
    }

    vector<pii> range(n+5,{1,n});

    for(auto [l,r] : ranges){
        int len1 = r-l+1;
        for(int i = l; i <= r; ++i){
            int len2 = range[i].ss - range[i].ff + 1;
            if(len1 < len2){
                range[i] = {l,r};
            }
        }        
    }

    int q; cin >> q;

    while(q--){
        int x,y; cin >> x >> y;
        auto [l,r] = range[x];
        if(l <= y and y <= r){
            yes;
        }
        else{
            no;
        }
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 596 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 540 KB Output is correct
7 Correct 140 ms 8896 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 596 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 540 KB Output is correct
7 Correct 140 ms 8896 KB Output is correct
8 Correct 94 ms 6484 KB Output is correct
9 Correct 97 ms 6368 KB Output is correct
10 Correct 97 ms 6752 KB Output is correct
11 Correct 102 ms 7220 KB Output is correct
12 Correct 87 ms 5968 KB Output is correct
13 Correct 102 ms 6576 KB Output is correct
14 Correct 98 ms 6548 KB Output is correct
15 Correct 100 ms 6544 KB Output is correct
16 Correct 102 ms 6312 KB Output is correct
17 Correct 97 ms 6576 KB Output is correct
18 Correct 116 ms 6604 KB Output is correct
19 Correct 121 ms 6552 KB Output is correct
20 Correct 91 ms 6476 KB Output is correct
21 Correct 95 ms 6316 KB Output is correct
22 Correct 97 ms 6372 KB Output is correct
23 Correct 240 ms 11428 KB Output is correct
24 Correct 247 ms 11484 KB Output is correct
25 Correct 245 ms 11376 KB Output is correct
26 Correct 308 ms 12800 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 176 ms 18960 KB Output is correct
2 Correct 213 ms 18544 KB Output is correct
3 Correct 181 ms 17968 KB Output is correct
4 Correct 206 ms 18848 KB Output is correct
5 Correct 205 ms 18724 KB Output is correct
6 Correct 180 ms 16616 KB Output is correct
7 Correct 197 ms 16212 KB Output is correct
8 Correct 185 ms 16104 KB Output is correct
9 Correct 222 ms 16204 KB Output is correct
10 Correct 156 ms 16116 KB Output is correct
11 Correct 150 ms 16252 KB Output is correct

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 596 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 540 KB Output is correct
7 Correct 140 ms 8896 KB Output is correct
8 Correct 94 ms 6484 KB Output is correct
9 Correct 97 ms 6368 KB Output is correct
10 Correct 97 ms 6752 KB Output is correct
11 Correct 102 ms 7220 KB Output is correct
12 Correct 87 ms 5968 KB Output is correct
13 Correct 102 ms 6576 KB Output is correct
14 Correct 98 ms 6548 KB Output is correct
15 Correct 100 ms 6544 KB Output is correct
16 Correct 102 ms 6312 KB Output is correct
17 Correct 97 ms 6576 KB Output is correct
18 Correct 116 ms 6604 KB Output is correct
19 Correct 121 ms 6552 KB Output is correct
20 Correct 91 ms 6476 KB Output is correct
21 Correct 95 ms 6316 KB Output is correct
22 Correct 97 ms 6372 KB Output is correct
23 Correct 240 ms 11428 KB Output is correct
24 Correct 247 ms 11484 KB Output is correct
25 Correct 245 ms 11376 KB Output is correct
26 Correct 308 ms 12800 KB Output is correct
27 Correct 176 ms 18960 KB Output is correct
28 Correct 213 ms 18544 KB Output is correct
29 Correct 181 ms 17968 KB Output is correct
30 Correct 206 ms 18848 KB Output is correct
31 Correct 205 ms 18724 KB Output is correct
32 Correct 180 ms 16616 KB Output is correct
33 Correct 197 ms 16212 KB Output is correct
34 Correct 185 ms 16104 KB Output is correct
35 Correct 222 ms 16204 KB Output is correct
36 Correct 156 ms 16116 KB Output is correct
37 Correct 150 ms 16252 KB Output is correct
38 Runtime error 490 ms 262144 KB Execution killed with signal 9
39 Halted 0 ms 0 KB -