Submission #1323739

#	Time	Username	Problem	Language	Result	Execution time	Memory
1323739		Trisanu_Das	Race (IOI11_race)	C++17	Compilation error	0 ms	0 KiB

race

#include "race.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int ans;
void dfs(int a,int par,vector<vector<pair<int,int> > >& g,int cnt,int dist,int k){
    if(cnt == k) ans = min(ans, dist);
    for(auto x : g[a]){
        if(x.first == par) continue;
        dfs(x.first, a, g, cnt + x.second, dist + 1, k);
    }
}
int ans_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]});
  }
  ans = INT_MAX;
  for(int i = 0; i < N; i++)dfs(i, i, g, 0, 0, K);
  if(ans == INT_MAX) ans = -1;
  return ans;
}

Compilation message (stderr)

/usr/bin/ld: /tmp/cc32Y7aj.o: in function `main':
grader.cpp:(.text.startup+0x28): undefined reference to `best_path(int, int, int (*) [2], int*)'
collect2: error: ld returned 1 exit status