# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
676719 | d4xn | Race (IOI11_race) | C++17 | 747 ms | 39340 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.
#pragma GCC optimize ("Ofast")
#include "race.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define map unordered_map
const int N = 2e5+1;
const ll inf = LLONG_MAX;
int n, k, sz[N];
ll ans;
vector<pair<int, ll>> adj[N];
bitset<N> r;
void dfs(int u, int par) {
sz[u] = 1;
for (auto &[v, w] : adj[u]) {
if (v == par || r[v]) continue;
dfs(v, u);
sz[u] += sz[v];
}
}
int find_centroid(int u, int par, int rt) {
for (auto &[v, w] : adj[u]) {
if (v != par && !r[v] && sz[v] > sz[rt]/2) {
return find_centroid(v, u, rt);
}
# | 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... |