Submission #425470

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

race

/*
 *  Written by
 *       ______  _   _  ______  ____  ____  ____  ____
 *      |_    _|| |_| ||_    _||_   || __ || __ |/  _/
 *        |  |  |  _  |  |  |    / / ||  ||||  ||| |__
 *        |  |  | | | |  |  |   | |_ ||__||||__||\__  \
 *        |__|  |_| |_|  |__|   |___||____||____|/____/
 */

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

#define nmax 200020
#define ii pair<int, int>
#define ll long long

int n, k, ans, h[nmax][2], l[nmax], cnt[1000100], sz[nmax], r[nmax];
vector<ii> adj[nmax];

inline void minimize(int &a, int b)
{
    if(a == -1 || a > b)
        a = b;
}

int dfs(int u, int p = -1)
{
    sz[u] = 1;
    for(auto [C, v]: adj[u]) {
        if(v != p && !r[v]) sz[u] += dfs(v, u);
    }
    return sz[u];
}

int get_centroid(int m, int u, int p = -1)
{
    for(auto [C, v]: adj[u]) {
        if(v != p && !r[v] && 2 * sz[v] > m) return get_centroid(m, v, u);
    }
    return u;
}

void get_cnt(int sum, bool filling, int u, int p = -1, int depth = 1)
{
    if(sum > k) return;
    if(filling)
        minimize(cnt[sum], depth);
    else {
        if(cnt[k - sum] != -1)
            minimize(ans, depth + cnt[k - sum]);
    }
    for(auto [C, v]: adj[u]) {
        if(v != p && !r[v]) get_cnt(sum + C, filling, v, u, depth + 1);
    }
}

void del(int sum, int u, int p = -1)
{
    if(sum > k) return;
    cnt[sum] = -1;
    for(auto [C, v]: adj[u]) {
        if(v != p && !r[v])
            del(sum + C, v, u);
    }
}

void centroid(int u = 0)
{
    u = get_centroid(dfs(u), u);
    r[u] = 1;
    cnt[0] = 0;
    for(auto [C, v]: adj[u]) {
        get_cnt(C, false, v);
        get_cnt(C, true, v);
    }
    for(auto [C, v]: adj[u]) {
        del(C, v);
    }
    for(auto [C, v]: adj[u]) {
        if(!r[v]) centroid(v);
    }
}

int best_path(int n, int k, int h[][2], int l[])
{
    for(int i = 0, u, v; i < n - 1; ++i) {
        u = h[i][0];
        v = h[i][1];
        adj[u].push_back(ii(l[i], v));
        adj[v].push_back(ii(l[i], u));
    }
    ans = -1;
    memset(cnt, -1, sizeof(cnt));
    centroid();
    return ans;
}

void solve()
{
    cin >> n >> k;
    for(int i = 0; i < n - 1; ++i) {
        cin >> h[i][0] >> h[i][1] >> l[i];
    }
    cout << best_path(n, k, h, l) << '\n';
}

int main()
{
    ios::sync_with_stdio(false); cin.tie(NULL);
//    freopen("in.inp", "r", stdin);
//    freopen("out.out", "w", stdout);
//    freopen("err.txt", "w", stderr);
    int T;
    for(T = 1; T--;) {
        solve();
    }
    return 0;
}

Compilation message (stderr)

/usr/bin/ld: /tmp/cci5FLcZ.o: in function `main':
race.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/cc4xv7YY.o:grader.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status