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>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
const int inf=1e3+9,MX=1e9+9;
vector< pair<int,int> > adj[inf];
bool ex[inf];
int dp[inf];
void dfs(int u,int par){
if(ex[u])
return ;
vector<int> tmp = {MX,MX,MX};
for(auto v:adj[u])
if( v.first != par )
dfs(v.first , u) , tmp[2] = dp[v.first]+v.second,sort(tmp.begin(),tmp.end());
dp[u] = tmp[1];
}
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
for(int i=0;i<M;i++)
adj[ R[i][0] ].push_back( make_pair( R[i][1] , L[i] ) ),
adj[ R[i][1] ].push_back(make_pair( R[i][0] , L[i] ));
for(int i=0;i<K;i++)
ex[ P[i] ] = 1;
dfs(0,-1);
return dp[0];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |