Submission #335404

#	Time	Username	Problem	Language	Result	Execution time	Memory
335404		codebuster_10	악어의 지하 도시 (IOI11_crocodile)	C++17	0 / 100	7 ms	492 KiB

crocodile

#include <bits/stdc++.h>
 
using namespace std ;

#define f(i,a,b) for(int i=a;i<b;++i)

void dfs(int i,int p,vector< vector< array<int,2> > > &g,vector<int> &best){
  vector<int> V ;
  for(auto [j,w]:g[i]) if(j!=p){
    dfs(j,i,g,best) ;
    V.push_back(best[j] + w) ;
  }
  sort(V.begin(),V.end()) ;
  best[i] = V[1] ;
}
int travel_plan(int N, int M, int R[][2],int L[], int K,int P[]){
  vector< vector< array<int,2> > > g(N) ;
  f(i,0,M){
    int u = R[i][0], v = R[i][1], w = L[i] ;
    g[u].push_back({v, w}) ;
    g[v].push_back({u, w}) ;
  }
  vector<int> best(N,-1) ;
  f(i,0,K) best[P[i]] = 0 ;
  dfs(0,0,g,best) ;
  return best[0] ;
}

• Subtask 1: 0 / 46
• Subtask 2: 0 / 43
• Subtask 3: 0 / 11