Submission #1244479

#	Time	Username	Problem	Language	Result	Execution time	Memory
1244479		bbldrizzy	Race (IOI11_race)	C++20	Compilation error	0 ms	0 KiB

race

#include <iostream>
#include <vector>
#include <set>
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
vector<vector<pair<int, int>>> adj;
vector<int> depth;
vector<int> dist;
vector<map<int, int>> st;
int ans = 1e9;
int n, k;

void dfs(int nd, int par) {
    for (P x: adj[nd]) {
        if (x.f != par) {
            depth[x.f] = depth[nd]+1;
            dist[x.f] = dist[nd] + x.s;
            dfs(x.f, nd);
        }
    }
    st[nd][dist[nd]] = depth[nd];
}

void dfs2(int nd, int par) {
    int niga = k+2*dist[nd];
    for (P x: adj[nd]) {
        if (x.f != par) {
            dfs2(x.f, nd);
            if (st[nd].size() < st[x.f].size()) swap(st[nd], st[x.f]);
            for (auto u: st[x.f]) {
                if (st[nd].find(niga-u.f) != st[nd].end()) {
                    ans = min(ans, u.s+st[nd][niga-u.f]-2*depth[nd]);
                }
            }
            for (auto u: st[x.f]) {
                if (st[nd].find(u.f) != st[nd].end()) {
                    st[nd][u.f] = min(st[nd][u.f], u.s);
                } else {
                    st[nd][u.f] = u.s;
                }
            }
        }
    }
}


int best_path(int N, int K, vector<vector<int>> H, vector<int> L) {
    adj.resize(N);
    depth.resize(N);
    dist.resize(N);
    st.resize(N);
    k = K;
    n = N;
    for (int i = 0; i < (N-1); i++) {
        int a, b, c;
        a = H[i][0];
        b = H[i][1];
        c = L[i];
        adj[a].push_back({b, c});
        adj[b].push_back({a, c});
    }
    dfs(0, 0);
    dfs2(0, 0);
    return (ans==1e9 ? -1 : ans);
}

Compilation message (stderr)

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