제출 #1009830

#제출 시각아이디문제언어결과실행 시간메모리
1009830Mardonbekhazratov악어의 지하 도시 (IOI11_crocodile)C++17
46 / 100
2 ms4696 KiB
#include "crocodile.h" #include<bits/stdc++.h> #define ll long long using namespace std; vector<int>ans; vector<bool>is,vis; vector<vector<pair<int,int>>>v; const int INF=1e9; void dfs(int x,int p=-1){ vis[x]=true; if(is[x]){ ans[x]=0; return; } vector<ll>a={INF,INF}; for(auto [z,w]:v[x]){ if(!vis[z]){ dfs(z,x); } if(z!=p) a.push_back(w+ans[z]); } sort(a.begin(),a.end()); ans[x]=a[1]; } int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){ is.assign(N,false); vis.assign(N,false); for(int i=0;i<K;i++) is[P[i]]=true; v.resize(N); ans.assign(N,false); for(int i=0;i<M;i++){ v[R[i][0]].push_back({R[i][1],L[i]}); v[R[i][1]].push_back({R[i][0],L[i]}); } dfs(0); return ans[0]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...