제출 #307404

#제출 시각아이디문제언어결과실행 시간메모리
307404juggernaut경주 (Race) (IOI11_race)C++14
21 / 100
3083 ms11256 KiB
#include"race.h" #include<bits/stdc++.h> using namespace std; vector<pair<int,int>>g[200005]; int k,i,inf=2e9,ans=inf; void dfs(int v,int p,int depth,int val){ if(val==k)ans=min(ans,depth); if(val>=k)return; for(auto to:g[v])if(to.first!=p)dfs(to.first,v,depth+1,val+to.second); } int best_path(int n,int K,int h[][2],int l[]){ k=K; for(i=1;i<n;i++){ g[h[i-1][1]].push_back({h[i-1][0],l[i-1]}); g[h[i-1][0]].push_back({h[i-1][1],l[i-1]}); } for(i=0;i<n;i++)dfs(i,i,0,0); if(ans==inf)return -1; return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...