제출 #748237

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
748237		Desh03	경주 (Race) (IOI11_race)	C++17	100 / 100	1064 ms	84264 KiB

race

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

int k, ans = 1e9;
vector<vector<pair<int, int>>> g;
vector<int> sz, dep, to;
vector<multiset<int>> ds;
vector<bool> centroid;

void calc(int u, int p) {
    sz[u] = 1;
    for (auto [v, w] : g[u])
        if (v ^ p && !centroid[v])
            calc(v, u), sz[u] += sz[v];
}

int findcentroid(int u, int p, int mx) {
    for (auto [v, w] : g[u])
        if (v ^ p && !centroid[v] && sz[v] * 2 > mx)
            return findcentroid(v, u, mx);
    return u;
}

void calcdep(int u, int p, int d) {
    dep[u] = d;
    for (auto [v, w] : g[u])
        if (v ^ p && !centroid[v])
            calcdep(v, u, d + 1);
}

void addmx(int u, int p, int length) {
    if (length > k) return;
    ds[length].insert(dep[u]);
    to.push_back(length);
    for (auto [v, w] : g[u])
        if (v ^ p && !centroid[v])
            addmx(v, u, length + w);
}

void calcmx(int u, int p, int length) {
    if (length > k) return;
    if (ds[k - length].size())
        ans = min(ans, dep[u] + *ds[k - length].begin());
    for (auto [v, w] : g[u])
        if (v ^ p && !centroid[v])
            calcmx(v, u, length + w);
}

void decompose(int u) {
    calc(u, u);
    int x = findcentroid(u, u, sz[u]);
    calcdep(x, x, 0);
    centroid[x] = 1, ds[0].insert(0);
    for (auto [v, w] : g[x]) {
        if (!centroid[v]) {
            calcmx(v, x, w);
            addmx(v, x, w);
        }
    }
    if (ds[k].size()) ans = min(ans, *ds[k].begin());
    for (int i : to) ds[i].clear();
    ds[0].clear(), to.clear();
    for (auto [v, w] : g[x]) {
        if (!centroid[v])
            decompose(v);
    }
}

int best_path(int n, int k_, int h[][2], int l[]) {
    k = k_;
    g = vector<vector<pair<int, int>>> (n), centroid = vector<bool> (n), dep = vector<int> (n), ds = vector<multiset<int>>(k + 1), sz = dep;
    for (int i = 0; i < n - 1; i++) {
        int u = h[i][0], v = h[i][1], w = l[i];
        g[u].push_back({v, w});
        g[v].push_back({u, w});
    }
    decompose(0);
    return ans == 1e9 ? -1 : ans;
}

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 22 / 22
• Subtask 4: 57 / 57