Submission #1288504

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

race

#include <bits/stdc++.h>
#include "race.h"
#define endl '\n'

using namespace std;

const int MAXN = 2e5;
int n, k, depth[MAXN + 5], ans;
long long sum[MAXN + 5];
map<long long,int>m[MAXN + 5];
vector<pair<int,int>>v[MAXN + 5];

void _merge(int x, int y)
{
    if(m[x].size() < m[y].size())swap(m[x], m[y]);


    for(auto [key, value]: m[y])
    {
        if(m[x].count(k - key + 2 * sum[x]))
        {
            ans = min(ans, m[x][k - key + 2 * sum[x]] + value - 2 * depth[x]);
        }
    }

    for(auto [key, value]: m[y])
    {
        if(m[x][key] == 0)
        {
            m[x][key] = value;
        }
        else m[x][key] = min(m[x][key], value);
    }
}

void dfsp(int node, int parent)
{
    depth[node] = depth[parent] + 1;
    for(auto i: v[node])
    {
        if(i.first == parent)continue;
        sum[i.first] = sum[node] + i.second;
        dfsp(i.first, node);
    }
}

void dfs(int node, int parent)
{
    for(auto i: v[node])
    {
        if(i.first == parent)continue;
        dfs(i.first, node);
        _merge(i.first, node);
    }
}

int best_path(int N, int K, vector<int>H[2], vector<int>L)
{
    n = N; k = K; ans = 1e9;
    for(int i = 0; i < n - 1; i++)
    {
        v[H[0][i]].push_back({H[1][i], L[i]});
        v[H[1][i]].push_back({H[0][i], L[i]});
    }
    depth[0] = -1;
    dfsp(0, 0);

    for(int i = 0; i < n; i++){
        m[i][sum[i]] = depth[i];
    }

    dfs(0, 0);
    if(ans == 1e9)ans = -1;
    return ans;
}

Compilation message (stderr)

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