제출 #638125

#제출 시각아이디문제언어결과실행 시간메모리
638125Iwanttobreakfree경주 (Race) (IOI11_race)C++17
컴파일 에러
0 ms0 KiB
#include "race.h"
#include <vector>
using namespace std;
int best;
void dfs(int a,int par,vector<vector<pair<int,int>>>& g,int cnt,int dist,int k){
    if(cnt==k)best=min(best,dist);
    for(auto x:g[a]){
        if(x.first==par)continue;
        dfs(x.first,a,g,cnt+x.second,dist+1,k);
    }
}
int best_path(int N, int K, int H[][2], int L[]){
  vector<vector<pair<int,int>>> g(N,vector<pair<int,int>>());
  for(int i=0;i<N-1;i++){
    g[H[i][0]].push_back({H[i][1],L[i]});
    g[H[i][1]].push_back({H[i][0],L[i]});
  }
  best=1e9;
  for(int i=0;i<n;i++)dfs(i,i,g,0,0,K);
  if(best==1e9)best=-1;
  return best;
}

컴파일 시 표준 에러 (stderr) 메시지

race.cpp: In function 'int best_path(int, int, int (*)[2], int*)':
race.cpp:19:17: error: 'n' was not declared in this scope
   19 |   for(int i=0;i<n;i++)dfs(i,i,g,0,0,K);
      |                 ^