제출 #42696

#제출 시각아이디문제언어결과실행 시간메모리
42696HassoonyBall Machine (BOI13_ballmachine)C++14
0 / 100
234 ms26084 KiB
#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){ for(auto pp:v[x]){ if(pp==p)continue; dp[0][pp]=x; dfs(pp,x); mn[x]=min(mn[x],mn[pp]); } mn[x]=min(mn[x],x); 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); 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); } } }

컴파일 시 표준 에러 (stderr) 메시지

ballmachine.cpp: In function 'int main()':
ballmachine.cpp:35:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&q);
                        ^
ballmachine.cpp:38:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&x);
                       ^
ballmachine.cpp:48:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&t,&x);
                            ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...