제출 #138023

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
138023		silxikys	Ball Machine (BOI13_ballmachine)	C++14	16.11 / 100	1081 ms	19436 KiB

ballmachine

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int maxn = 1e5+5;
const int INV = -1;
int N, Q;
vector<int> adj[maxn];

int minsub[maxn];
int ord[maxn], inv[maxn]; //node to seg, seg to node
int pt = 1;

int seg[maxn];

void prep(int i) {
    minsub[i] = i;
    for (int j: adj[i]) {
        minsub[i] = min(minsub[i],minsub[j]);
    }
    sort(adj[i].begin(),adj[i].end(),[](int a, int b) {
            return minsub[a] < minsub[b];
            });
}
void dfs(int i) {
    for (int j: adj[i]) {
        dfs(j);
    }
    ord[i] = pt;
    inv[pt] = i;
    pt++;
    //cout << i << ' ';
}

const int maxk = 18;
int par[maxk][maxn];

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> N >> Q;
    int rt = -1;
    for (int i = 1; i <= N; i++) {
        int pi; cin >> pi;
        if (pi == 0) rt = i;
        else adj[pi].push_back(i);
        par[0][i] = pi;
    }
    for (int k = 1; k < maxk; k++) {
        for (int i = 1; i <= N; i++) {
            par[k][i] = par[k-1][par[k-1][i]];
        }
    }
    prep(rt);
    dfs(rt);
    for (int i = 1; i <= N; i++) {
        seg[i] = 1;
    }
    while (Q--) {
        int t; cin >> t;
        if (t == 1) {
            int k; cin >> k;
            int sum = 0;
            for (int i = 1; i <= N; i++) {
                sum += seg[i];
                if (sum == k) {
                    for (int j = 1; j <= i; j++) {
                        seg[j] = 0;
                    }
                    cout << inv[i] << '\n';
                    break;
                }
            }
        }
        else {
            int v; cin >> v;
            int res = 0;
            for (int k = maxk - 1; k >= 0; k--) {
                if (par[k][v] == 0) continue;
                int nxt = par[k][v];
                if (seg[ord[nxt]] == 0) {
                    res += (1<<k);
                    v = nxt;
                }
            }
            seg[ord[v]] = 1;
            cout << res << '\n';
        }
    }
}

• Subtask 1: 0 / 25
• Subtask 2: 6.428571428571429 / 30
• Subtask 3: 8.571428571428571 / 40
• Subtask 4: 1.1111111111111112 / 5