oj.uz

답안 #749798

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
749798 2023-05-28T13:54:18 Z GrindMachine Long Mansion (JOI17_long_mansion) C++17
25 / 100
 414 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 all r s.t [l,r] is unextendable
        for(int r = l; r < right_pos[l]; ++r){
            if(left_pos[r] < l){
                ranges.pb({l,r});
            }
        }
    }

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

    for(auto [l,r] : ranges){
        for(int i = l; i <= r; ++i){
            if(l > range[i].ff){
                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 3 ms 468 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 137 ms 8768 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 468 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 137 ms 8768 KB Output is correct
8 Correct 89 ms 2044 KB Output is correct
9 Correct 100 ms 2040 KB Output is correct
10 Correct 93 ms 2212 KB Output is correct
11 Correct 91 ms 2504 KB Output is correct
12 Correct 85 ms 2128 KB Output is correct
13 Correct 86 ms 2384 KB Output is correct
14 Correct 86 ms 2184 KB Output is correct
15 Correct 86 ms 2176 KB Output is correct
16 Correct 85 ms 2380 KB Output is correct
17 Correct 86 ms 2108 KB Output is correct
18 Correct 87 ms 2184 KB Output is correct
19 Correct 84 ms 2168 KB Output is correct
20 Correct 88 ms 2520 KB Output is correct
21 Correct 84 ms 2372 KB Output is correct
22 Correct 86 ms 2208 KB Output is correct
23 Correct 217 ms 8768 KB Output is correct
24 Correct 221 ms 8812 KB Output is correct
25 Correct 218 ms 8768 KB Output is correct
26 Correct 267 ms 8768 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 159 ms 11716 KB Output is correct
2 Correct 161 ms 11460 KB Output is correct
3 Correct 151 ms 10956 KB Output is correct
4 Correct 165 ms 11504 KB Output is correct
5 Correct 159 ms 11456 KB Output is correct
6 Correct 130 ms 10204 KB Output is correct
7 Correct 127 ms 10108 KB Output is correct
8 Correct 128 ms 10060 KB Output is correct
9 Correct 129 ms 10064 KB Output is correct
10 Correct 127 ms 10188 KB Output is correct
11 Correct 134 ms 10092 KB Output is correct

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 468 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 137 ms 8768 KB Output is correct
8 Correct 89 ms 2044 KB Output is correct
9 Correct 100 ms 2040 KB Output is correct
10 Correct 93 ms 2212 KB Output is correct
11 Correct 91 ms 2504 KB Output is correct
12 Correct 85 ms 2128 KB Output is correct
13 Correct 86 ms 2384 KB Output is correct
14 Correct 86 ms 2184 KB Output is correct
15 Correct 86 ms 2176 KB Output is correct
16 Correct 85 ms 2380 KB Output is correct
17 Correct 86 ms 2108 KB Output is correct
18 Correct 87 ms 2184 KB Output is correct
19 Correct 84 ms 2168 KB Output is correct
20 Correct 88 ms 2520 KB Output is correct
21 Correct 84 ms 2372 KB Output is correct
22 Correct 86 ms 2208 KB Output is correct
23 Correct 217 ms 8768 KB Output is correct
24 Correct 221 ms 8812 KB Output is correct
25 Correct 218 ms 8768 KB Output is correct
26 Correct 267 ms 8768 KB Output is correct
27 Correct 159 ms 11716 KB Output is correct
28 Correct 161 ms 11460 KB Output is correct
29 Correct 151 ms 10956 KB Output is correct
30 Correct 165 ms 11504 KB Output is correct
31 Correct 159 ms 11456 KB Output is correct
32 Correct 130 ms 10204 KB Output is correct
33 Correct 127 ms 10108 KB Output is correct
34 Correct 128 ms 10060 KB Output is correct
35 Correct 129 ms 10064 KB Output is correct
36 Correct 127 ms 10188 KB Output is correct
37 Correct 134 ms 10092 KB Output is correct
38 Runtime error 414 ms 262144 KB Execution killed with signal 9
39 Halted 0 ms 0 KB -