# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42698 | Hassoony | Ball Machine (BOI13_ballmachine) | C++14 | 217 ms | 26124 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX=2e5+9;
const ll mod=1e8+6;
int n,q,dp[20][MX],ball[MX],mn[MX],timer,out[MX],x,t,root;
bool cmp(int A,int B){
return mn[A]<mn[B];
}
vector<int>v[MX];
priority_queue<pair<int,int> >pq;
void dfs(int x,int p){
mn[x]=x;
for(auto pp:v[x]){
if(pp==p)continue;
dfs(pp,x);
mn[x]=min(mn[x],mn[pp]);
}
sort(v[x].begin(),v[x].end(),cmp);
}
void build(){
for(int i=1;i<=18;i++)
for(int j=1;j<=n;j++)
dp[i][j]=dp[i-1][dp[i-1][j]];
}
void pro(int x,int p){
for(auto pp:v[x]){
if(pp==p)continue;
dfs(pp,x);
}
out[x]=++timer;
}
int main(){
scanf("%d%d",&n,&q);
for(int i=1;i<=n;i++){
mn[i]=MX;
scanf("%d",&x);
dp[0][i]=x;
if(x==0){root=i;continue;}
v[x].push_back(i);
v[i].push_back(x);
}
dfs(root,-1);
build();
pro(root,-1);
for(int i=1;i<=n;i++)pq.push({-out[i],i});
while(q--){
scanf("%d%d",&t,&x);
if(t==1){
int last=0;
while(x--){
ball[pq.top().second]=1;
last=pq.top().second;
pq.pop();
}
printf("%d\n",last);
}
else{
int ans=0;
for(int i=18;i>=0;i--){
if(ball[dp[i][x]]){
x=dp[i][x];
ans+=(1<<i);
}
}
ball[x]=0;
pq.push({-out[x],x});
printf("%d\n",ans);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |