# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
379835 | huynhtrankhanh | Race (IOI11_race) | C++17 | 563 ms | 48236 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int best_path(int n, int k, int h[][2], int l[])
{
const int maxn = 200001;
const int inf = 0x3f3f3f3f;
vector<pair<int, int>> graph[maxn];
for (int i = 0; i < n - 1; i++)
{
int u = h[i][0];
int v = h[i][1];
int w = l[i];
graph[u].emplace_back(v, w);
graph[v].emplace_back(u, w);
}
int size[maxn];
bool ignored[maxn];
memset(ignored, 0, sizeof(ignored));
auto get_centroid = [&](int root) {
{
auto dfs = [&](auto dfs, int vertex, int parent) -> void {
size[vertex] = 0;
for (auto [adjacent, _]: graph[vertex])
if (adjacent != parent) if (!ignored[adjacent])
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |