제출 #1136898

#제출 시각아이디문제언어결과실행 시간메모리
1136898simplemind_31새로운 문제 (POI13_luk)C++20
30 / 100
261 ms18568 KiB
#include <bits/stdc++.h> using namespace std; int n,a,b; vector<vector<int>> graph; int degree[300000]; bool solve(int now,int ante,int cantitrab,int cadadia){ if(degree[now]-1>cantitrab){ return false; } for(auto u:graph[now]){ if(u==ante){ continue; } if(!solve(u,now,cantitrab-(degree[now]-1)+cadadia,cadadia)){ return false; } } return true; } int main(){ scanf("%d",&n); graph.resize(n); int l=0,r=n; while(--n){ scanf("%d%d",&a,&b); a--;b--; degree[a]++;degree[b]++; graph[a].push_back(b); graph[b].push_back(a); } degree[0]++; while(l<r){ int mid=(l+r)>>1; if(solve(0,-1,mid,mid)){ r=mid; }else{ l=mid+1; } } printf("%d",l); }

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

luk.cpp: In function 'int main()':
luk.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
luk.cpp:25:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |         scanf("%d%d",&a,&b);
      |         ~~~~~^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...