# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
319913 | knon0501 | Crocodile's Underground City (IOI11_crocodile) | C++14 | 206 ms | 262148 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 "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<int,int>> a[100001];
long long dp[100001];
int chk[100001];
long long dfs(int v,int p){
if(chk[v])return dp[v]=0;
vector<long long> b;
for(auto u: a[v]){
if(u.first==p)continue;
b.push_back(dfs(u.first,v)+u.second);
}
sort(b.begin(),b.end());
if(b.size()<=1)return 1e18;
return dp[v]=b[1];
}
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
n=N;
int i,j;
for(i=0 ; i<K ; i++)chk[P[i]]=1;
for(i=0 ; i<M ; i++){
int u=R[i][0];
int v=R[i][1];
a[u].push_back({v,L[i]});
a[v].push_back({u,L[i]});
}
dfs(0,-1);
return dp[0];
}
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... |