# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1200253 | timasdfadsfadsf | Race (IOI11_race) | C++20 | 0 ms | 0 KiB |
process(v, u, depth + 1, sum + w, filling, c);
}
}
}
void build(int u, int p) {
int n = dfs(u, p);
int c = dfs(u, p, c);
par[c] = p;
rem[c] = true;
mp[0] = {0, c};
for (auto [v, w] : tree[c]) {
if (!rem[v]) {
process(v, c, 1, w, 0, c);
process(v, c, 1, w, 1, c);
}
}
for (auto [v, w] : tree[c]) {
if (!rem[v]) {
build(v, u);
}
}
}
public:
CD(const vector<vector<pair<int, long long>>>& t, int k_) {
int n = t.size();
sub.resize(n);
rem.resize(n);
par.resize(n);
tree = t;
k = k_;
build(0, -1);
}
int solve() {
return ans;
}
};
struct edge {
int u, v, w;
};
int best_path(int n, int k, int h[][2], int* l) {
vector<edge> E(n - 1);
for (int i = 0; i < n - 1; i++) {
int u = h[i][0], v = h[i][1];
E[i] = {u, v, -1};
}
for (int i = 0; i < n - 1; i++) {
int ll = l[i];
E[i].w = ll;
}
vector<vector<pair<int, long long>>> t(n);
for (auto e : E) {
t[e.u].push_back({e.v, e.w});
t[e.v].push_back({e.u, e.w});
}
CD g(t, k);
return g.solve();
}