Submission #1149962

#TimeUsernameProblemLanguageResultExecution timeMemory
1149962sasdeRace (IOI11_race)C++20
Compilation error
0 ms0 KiB
#include<bits/stdc++.h> #define ii pair<int,int> #define fi first #define se second #define int long long #define task "" using namespace std; const int N = 1e6 + 10, mod = 1e9 + 7; const int oo = 1e18; int best_path(int N, int K, int H[][2], int L[]){ // n = N; k = K; // for(int i = 0; i < n - 1; i++){ // H[i][0]++; H[i][1]++; // g[H[i][0]].push_back(ii(H[i][1], L[i])); // g[H[i][1]].push_back(ii(H[i][0], L[i])); // } // // memset(is_centroid, 0, sizeof(is_centroid)); // for(int i = 1; i <= k; i++) // mi[i] = oo; // ans = oo; // build_centroid(1, -1); return -1; }

Compilation message (stderr)

/usr/bin/ld: /tmp/ccIPChUl.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