oj.uz

Submission #647707

# Submission time Handle Problem Language Result Execution time Memory
647707 2022-10-03T17:32:42 Z PoonYaPat Ball Machine (BOI13_ballmachine) C++14
100 / 100
 206 ms 28736 KB 
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;

int n,m,p[100001][18],mmin[100001],root,dis[100001],pos[100001];
vector<int> adj[100001],ord;
priority_queue<int, vector<int>, greater<int>> q;
bool emp[100001]; //less than cnt and empty (also in q)

int dfs(int x, int par) {
    mmin[x]=x;
    dis[x]=dis[par]+1;
    for (auto s : adj[x]) {
        if (s==par) continue;
        mmin[x]=min(mmin[x],dfs(s,x));
    }
    return mmin[x];
}

void dfs_ord(int x, int par) {
    vector<pii> v;
    for (auto s : adj[x]) {
        if (s==par) continue;
        v.push_back(pii(mmin[s],s));
    }
    sort(v.begin(),v.end());
    for (auto s : v) dfs_ord(s.second,x);
    ord.push_back(x);
}

void dfs_par(int x, int par) {
    for (int i=1; i<=17; ++i) p[x][i]=p[p[x][i-1]][i-1];
    for (auto s : adj[x]) {
        if (s==par) continue;
        dfs_par(s,x);
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>m;
    for (int i=1; i<=n; ++i) {
        int x; cin>>x;
        p[i][0]=x;
        adj[x].push_back(i);
        if (x==0) root=x;
    }

    dfs(root,root);
    dfs_ord(root,root);
    dfs_par(root,root);

    for (int i=0; i<n; ++i) pos[ord[i]]=i;
    pos[0]=100010;

    int cnt=-1;
    while (m--) {
        int mode,x; cin>>mode>>x;
        if (mode==1) {
            int ans=-1;
            while (!q.empty() && x) {
                --x;
                ans=ord[q.top()];
                emp[q.top()]=false;
                q.pop();
            }
            cnt+=x;
            if (x) cout<<ord[cnt]<<"\n";
            else cout<<ans<<"\n";

        } else {
            int y=x;
            for (int i=17; i>=0; --i) if (!emp[pos[p[x][i]]] && pos[p[x][i]]<=cnt) x=p[x][i];
            cout<<dis[y]-dis[x]<<"\n";

            emp[pos[x]]=true;
            q.push(pos[x]);
        }
    }
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 86 ms 9756 KB Output is correct
3 Correct 58 ms 9820 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 6 ms 3164 KB Output is correct
10 Correct 17 ms 4436 KB Output is correct
11 Correct 80 ms 9912 KB Output is correct
12 Correct 54 ms 9844 KB Output is correct
13 Correct 75 ms 9612 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 7504 KB Output is correct
2 Correct 159 ms 20216 KB Output is correct
3 Correct 65 ms 13004 KB Output is correct
4 Correct 52 ms 8140 KB Output is correct
5 Correct 54 ms 8004 KB Output is correct
6 Correct 57 ms 8024 KB Output is correct
7 Correct 56 ms 6732 KB Output is correct
8 Correct 34 ms 7560 KB Output is correct
9 Correct 123 ms 20428 KB Output is correct
10 Correct 133 ms 20252 KB Output is correct
11 Correct 128 ms 20156 KB Output is correct
12 Correct 143 ms 16904 KB Output is correct
13 Correct 115 ms 25420 KB Output is correct
14 Correct 66 ms 12920 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 11872 KB Output is correct
2 Correct 156 ms 17856 KB Output is correct
3 Correct 110 ms 23476 KB Output is correct
4 Correct 90 ms 17060 KB Output is correct
5 Correct 94 ms 16856 KB Output is correct
6 Correct 96 ms 16968 KB Output is correct
7 Correct 97 ms 14620 KB Output is correct
8 Correct 110 ms 23416 KB Output is correct
9 Correct 136 ms 21056 KB Output is correct
10 Correct 159 ms 20468 KB Output is correct
11 Correct 170 ms 20552 KB Output is correct
12 Correct 146 ms 17904 KB Output is correct
13 Correct 206 ms 28736 KB Output is correct
14 Correct 98 ms 13912 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 20816 KB Output is correct
2 Correct 145 ms 17456 KB Output is correct
3 Correct 123 ms 28460 KB Output is correct
4 Correct 166 ms 20796 KB Output is correct
5 Correct 149 ms 20432 KB Output is correct
6 Correct 126 ms 20312 KB Output is correct
7 Correct 141 ms 17472 KB Output is correct
8 Correct 118 ms 28524 KB Output is correct
9 Correct 62 ms 13048 KB Output is correct