Submission #994457

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
994457	2024-06-07T16:37:14 Z	pannenkoek	Race (IOI11_race)	C++17	Compilation error	0 ms	0 KB

race

#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define pb push_back
#define fi first
#define se second

using ll = long long;
using ld = long double;
using pii = pair<ll, ll>;

const int MAXN = 2e5 + 5;
vector<pii> adj[MAXN];
map<ll, ll> poss[MAXN]; 
ll off[MAXN], cost_off[MAXN];
ll res = 1e18;
int k;

void dfs(ll v, ll p){
    poss[v][0] = 0;
    for(auto [u, d]: adj[v]){
        if(u == p) continue;
        dfs(u, v);
        off[u] += d;
        cost_off[u]++;
        if(poss[u].size() > poss[v].size()) {
            swap(off[u], off[v]);
            swap(cost_off[u], cost_off[v]);
            swap(poss[u], poss[v]);
        }
        set<ll> new_entries;
        map<ll, ll> old_vals;
        for(auto [dis, cost]: poss[u]){
            ll real_dis = dis + off[u];
            if(real_dis > k) continue;
            ll miss = k - real_dis - off[v];
            if(poss[v].count(miss) && !new_entries.count(miss)){
                ll old_cost = poss[v][miss];
                if(old_vals.count(miss)) {
                    old_cost = old_vals[miss]; 
                }
                res = min(old_cost + cost_off[u] + cost_off[v] + cost, res);
            }
            real_dis -= off[v];
            if(poss[v].count(real_dis)) {
                old_vals[real_dis] = poss[v][real_dis];
                poss[v][real_dis] = min(poss[v][real_dis], cost + cost_off[u] - cost_off[v]);
            } else {
                poss[v][real_dis] = cost + cost_off[u] - cost_off[v];
                new_entries.insert(real_dis);
            }
        }
        poss[u] = {};
    }
}

Compilation message

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