#include <bits/stdc++.h>
using namespace std;
vector<int> p, order, depth, pos;
vector< vector<int> > children, up;
vector<int> used;
int root, cnt, max_log;
pair<int, vector<int> > dfs(int u, int par, int d) {
int mn = u;
depth[u] = d;
vector< pair<int, vector<int> > > tmp;
up[u][0] = par;
for (int i = 1; i <= max_log; i++) {
up[u][i] = up[up[u][i - 1]][i - 1];
}
for (auto v : children[u]) {
tmp.push_back(dfs(v, u, d + 1));
mn = min(mn, tmp.back().first);
}
sort(tmp.begin(), tmp.end());
vector<int> ans;
for (auto& v : tmp) {
for (auto& x : v.second) {
ans.push_back(x);
}
}
ans.push_back(u);
return {mn, ans};
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
max_log = (int) ceil(log2((double) n));
up.assign(n + 1, vector<int>(max_log + 1));
p.resize(n + 1);
children.resize(n + 1);
for (int i = 1; i <= n; i++) {
cin >> p[i];
if (p[i] == 0) {
root = i;
} else {
children[p[i]].push_back(i);
}
}
depth.resize(n + 1);
pos.resize(n + 1);
order = dfs(root, root, 0).second;
for (int i = 0; i < n; i++) {
pos[order[i]] = i;
}
used.assign(n + 1, 0);
set<int> st;
for (int i = 1; i <= n; i++) {
st.insert(pos[i]);
}
while (q--) {
int type, k;
cin >> type >> k;
if (type == 1) {
int last;
for (auto& x : st) {
if (k == 0) {
break;
}
k--;
used[order[x]] = 1;
st.erase(x);
last = order[x];
}
cout << last << '\n';
} else {
int oldK = k;
for (int i = max_log; i >= 0; i--) {
if (used[up[k][i]]) {
k = up[k][i];
}
}
used[k] = 0;
st.insert(k);
cout << depth[oldK] - depth[k] << '\n';
}
}
return 0;
}
Compilation message
ballmachine.cpp: In function 'int main()':
ballmachine.cpp:74:23: warning: 'last' may be used uninitialized in this function [-Wmaybe-uninitialized]
cout << last << '\n';
^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 2 |
Incorrect |
204 ms |
14164 KB |
Output isn't correct |
| 3 |
Incorrect |
148 ms |
14432 KB |
Output isn't correct |
| 4 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 5 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 6 |
Correct |
4 ms |
512 KB |
Output is correct |
| 7 |
Incorrect |
3 ms |
512 KB |
Output isn't correct |
| 8 |
Incorrect |
3 ms |
512 KB |
Output isn't correct |
| 9 |
Incorrect |
12 ms |
1152 KB |
Output isn't correct |
| 10 |
Incorrect |
33 ms |
3828 KB |
Output isn't correct |
| 11 |
Incorrect |
208 ms |
14224 KB |
Output isn't correct |
| 12 |
Incorrect |
142 ms |
14484 KB |
Output isn't correct |
| 13 |
Incorrect |
218 ms |
14240 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
496 ms |
7768 KB |
Output isn't correct |
| 2 |
Execution timed out |
1064 ms |
25752 KB |
Time limit exceeded |
| 3 |
Incorrect |
173 ms |
21192 KB |
Output isn't correct |
| 4 |
Incorrect |
334 ms |
9488 KB |
Output isn't correct |
| 5 |
Incorrect |
865 ms |
9356 KB |
Output isn't correct |
| 6 |
Incorrect |
762 ms |
9392 KB |
Output isn't correct |
| 7 |
Incorrect |
344 ms |
7668 KB |
Output isn't correct |
| 8 |
Incorrect |
579 ms |
7576 KB |
Output isn't correct |
| 9 |
Execution timed out |
1058 ms |
24916 KB |
Time limit exceeded |
| 10 |
Execution timed out |
1083 ms |
25968 KB |
Time limit exceeded |
| 11 |
Execution timed out |
1060 ms |
25796 KB |
Time limit exceeded |
| 12 |
Execution timed out |
1076 ms |
20836 KB |
Time limit exceeded |
| 13 |
Execution timed out |
1075 ms |
29868 KB |
Time limit exceeded |
| 14 |
Incorrect |
178 ms |
21320 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1065 ms |
15212 KB |
Time limit exceeded |
| 2 |
Execution timed out |
1074 ms |
21992 KB |
Time limit exceeded |
| 3 |
Execution timed out |
1071 ms |
27052 KB |
Time limit exceeded |
| 4 |
Execution timed out |
1076 ms |
20456 KB |
Time limit exceeded |
| 5 |
Execution timed out |
1082 ms |
21112 KB |
Time limit exceeded |
| 6 |
Execution timed out |
1079 ms |
20680 KB |
Time limit exceeded |
| 7 |
Execution timed out |
1071 ms |
17236 KB |
Time limit exceeded |
| 8 |
Execution timed out |
1080 ms |
27412 KB |
Time limit exceeded |
| 9 |
Execution timed out |
1077 ms |
25256 KB |
Time limit exceeded |
| 10 |
Execution timed out |
1076 ms |
25492 KB |
Time limit exceeded |
| 11 |
Execution timed out |
1085 ms |
25644 KB |
Time limit exceeded |
| 12 |
Execution timed out |
1072 ms |
21228 KB |
Time limit exceeded |
| 13 |
Execution timed out |
1074 ms |
33608 KB |
Time limit exceeded |
| 14 |
Correct |
331 ms |
21060 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1079 ms |
25116 KB |
Time limit exceeded |
| 2 |
Execution timed out |
1074 ms |
21640 KB |
Time limit exceeded |
| 3 |
Execution timed out |
1077 ms |
33488 KB |
Time limit exceeded |
| 4 |
Execution timed out |
1081 ms |
25264 KB |
Time limit exceeded |
| 5 |
Execution timed out |
1072 ms |
25600 KB |
Time limit exceeded |
| 6 |
Execution timed out |
1055 ms |
25704 KB |
Time limit exceeded |
| 7 |
Execution timed out |
1073 ms |
21076 KB |
Time limit exceeded |
| 8 |
Execution timed out |
1074 ms |
33580 KB |
Time limit exceeded |
| 9 |
Incorrect |
182 ms |
21360 KB |
Output isn't correct |
