# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
998190 | The_Samurai | Race (IOI11_race) | C++17 | 244 ms | 63316 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"
#include "race.h"
using namespace std;
using ll = long long;
const int inf = 1e9, N = 2e5 + 5;
int ans = inf, k, z = 0;
vector<vector<pair<int, int>>> g(N);
vector<int> par(N, -1), heavy(N), height2(N);
vector<ll> height(N);
vector<set<pair<ll, int>>> st;
/*
*/
int dfs(int u) {
int size = 1, max_child_size = 0;
for (auto [v, w]: g[u]) {
if (par[u] == v) continue;
height[v] = height[u] + w;
height2[v] = height2[u] + 1;
par[v] = u;
int child_size = dfs(v);
if (child_size > max_child_size) {
heavy[u] = heavy[v];
max_child_size = child_size;
}
size += child_size;
}
if (size == 1) {
# | 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... |