제출 #1134857

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1134857		steveonalex	Long Mansion (JOI17_long_mansion)	C++20	100 / 100	170 ms	19668 KiB

long_mansion

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}

ll gcd(ll a, ll b){return __gcd(a, b);}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return __lg(mask);}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n"){
        for(auto item: container) cout << item << separator;
        cout << finish;
    }


template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 5e5 + 69;

void solve(){
    int n; cin >> n;
    vector<int> c(n+1);
    for(int i = 1; i < n; ++i) cin >> c[i];

    vector<int> b(n+1);
    vector<int> key(N);
    for(int i = 1; i <= n; ++i){
        cin >> b[i];
        b[i] += b[i-1];
        for(int j = b[i-1]; j < b[i]; ++j) cin >> key[j];
    }

    vector<int> previ(n+1), nxt(n+1, n+1);
    vector<int> last(n+1);
    for(int i = 1; i < n; ++i){
        for(int it = b[i-1]; it < b[i]; ++it) last[key[it]] = i;
        previ[i] = last[c[i]];
    }
    last = vector<int>(n+1, n+1);
    for(int i = n; i >= 2; --i){
        for(int it = b[i-1]; it < b[i]; ++it) last[key[it]] = i;
        nxt[i-1] = last[c[i-1]];
    }

    vector<int> perm(n);
    for(int i = 0; i < n; ++i) perm[i] = i + 1;
    shuffle(ALL(perm), rng);

    vector<pair<int,int>> ans(n+1);
    for(int i= 1; i <= n; ++i) ans[i] = {i, i};

    int it_cnt = 0;
    for(int i: perm){
        int l = i, r = i;
        while(true){
            it_cnt++;
            int updated = 0;
            updated += minimize(l, min(ans[l].first, ans[r].first));
            updated += maximize(r, max(ans[l].second, ans[r].second));
            if (l > 1){
                if (nxt[l-1] <= r) {
                    l--;
                    updated++;
                }
            }
            if (r < n){
                if (previ[r] >= l){
                    r++;
                    updated++;
                }
            }
            if (updated == false) break;
        }
        ans[i] = {l, r};
    }

    // cerr << it_cnt << "\n";

    // for(int i = 1; i <=n; ++i) cout << ans[i].first << " " << ans[i].second << "\n";

    int q; cin >> q;
    while(q--){
        int x, y; cin >> x >> y;
        pair<int, int> cur = ans[x];
        if (cur.first <= y && y <= cur.second) cout << "YES\n";
        else cout << "NO\n";
    }
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    clock_t start = clock();

    solve();

    cerr << "Time elapsed: " << clock() - start << "ms!\n";
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 15 / 15
• Subtask 4: 75 / 75