#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>
const int mxn = 1e5+10;
vector<int> tree[mxn];
vector<int> eul;
int par[mxn][20],dep[mxn];
int N,Q;
int rt;
int dp[mxn];
int dfn[mxn];
set<int> st;
void dfs(int now){
for(int i = 1;i<20;i++)par[now][i] = par[par[now][i-1]][i-1];
sort(tree[now].begin(),tree[now].end());
for(auto nxt:tree[now]){
dep[nxt] = dep[now]+1;
dfs(nxt);
}
dfn[now] = eul.size();
eul.push_back(now);
return;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>N>>Q;
for(int i = 1;i<=N;i++){
int p;
cin>>p;
par[i][0] = p;
tree[p].push_back(i);
if(!p)rt = i;
}
par[rt][0] = rt;
dfs(rt);
for(int i = 0;i<N;i++)st.insert(i);
return 0;
while(Q--){
int t,k;
cin>>t>>k;
int lst = 0;
if(t == 1){
while(k--){
lst = *st.begin();
st.erase(st.begin());
dp[eul[lst]] = true;
}
cout<<eul[lst]<<'\n';
}
else{
lst = k;
for(int i = 19;i>=0;i--){
if(dp[par[lst][i]])lst = par[lst][i];
}
dp[lst] = false;
st.insert(dfn[lst]);
cout<<dep[k]-dep[lst]<<'\n';
}
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
5464 KB |
Output isn't correct |
| 2 |
Incorrect |
24 ms |
13992 KB |
Output isn't correct |
| 3 |
Incorrect |
24 ms |
14012 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
5468 KB |
Output isn't correct |
| 5 |
Incorrect |
1 ms |
5468 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
5464 KB |
Output isn't correct |
| 7 |
Incorrect |
1 ms |
5468 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
5468 KB |
Output isn't correct |
| 9 |
Incorrect |
3 ms |
5724 KB |
Output isn't correct |
| 10 |
Incorrect |
7 ms |
8536 KB |
Output isn't correct |
| 11 |
Incorrect |
24 ms |
14040 KB |
Output isn't correct |
| 12 |
Incorrect |
24 ms |
14032 KB |
Output isn't correct |
| 13 |
Incorrect |
25 ms |
14032 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
8 ms |
10072 KB |
Output isn't correct |
| 2 |
Incorrect |
49 ms |
21712 KB |
Output isn't correct |
| 3 |
Incorrect |
39 ms |
18120 KB |
Output isn't correct |
| 4 |
Incorrect |
12 ms |
10840 KB |
Output isn't correct |
| 5 |
Incorrect |
12 ms |
10588 KB |
Output isn't correct |
| 6 |
Incorrect |
13 ms |
10584 KB |
Output isn't correct |
| 7 |
Incorrect |
12 ms |
9804 KB |
Output isn't correct |
| 8 |
Incorrect |
8 ms |
10116 KB |
Output isn't correct |
| 9 |
Incorrect |
49 ms |
22224 KB |
Output isn't correct |
| 10 |
Incorrect |
56 ms |
21716 KB |
Output isn't correct |
| 11 |
Incorrect |
54 ms |
22052 KB |
Output isn't correct |
| 12 |
Incorrect |
47 ms |
20172 KB |
Output isn't correct |
| 13 |
Incorrect |
48 ms |
24528 KB |
Output isn't correct |
| 14 |
Incorrect |
49 ms |
18060 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
23 ms |
14804 KB |
Output isn't correct |
| 2 |
Incorrect |
47 ms |
20184 KB |
Output isn't correct |
| 3 |
Incorrect |
43 ms |
23248 KB |
Output isn't correct |
| 4 |
Incorrect |
41 ms |
20168 KB |
Output isn't correct |
| 5 |
Incorrect |
37 ms |
19912 KB |
Output isn't correct |
| 6 |
Incorrect |
38 ms |
19920 KB |
Output isn't correct |
| 7 |
Incorrect |
37 ms |
18516 KB |
Output isn't correct |
| 8 |
Incorrect |
42 ms |
23220 KB |
Output isn't correct |
| 9 |
Incorrect |
55 ms |
22224 KB |
Output isn't correct |
| 10 |
Incorrect |
50 ms |
21968 KB |
Output isn't correct |
| 11 |
Incorrect |
52 ms |
21964 KB |
Output isn't correct |
| 12 |
Incorrect |
46 ms |
20368 KB |
Output isn't correct |
| 13 |
Incorrect |
66 ms |
26060 KB |
Output isn't correct |
| 14 |
Incorrect |
37 ms |
18084 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
49 ms |
22228 KB |
Output isn't correct |
| 2 |
Incorrect |
64 ms |
20172 KB |
Output isn't correct |
| 3 |
Incorrect |
65 ms |
26084 KB |
Output isn't correct |
| 4 |
Incorrect |
50 ms |
22224 KB |
Output isn't correct |
| 5 |
Incorrect |
49 ms |
21968 KB |
Output isn't correct |
| 6 |
Incorrect |
49 ms |
21720 KB |
Output isn't correct |
| 7 |
Incorrect |
47 ms |
20400 KB |
Output isn't correct |
| 8 |
Incorrect |
67 ms |
26032 KB |
Output isn't correct |
| 9 |
Incorrect |
36 ms |
18116 KB |
Output isn't correct |
