# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108725 | turbat | Race (IOI11_race) | C++14 | 1976 ms | 38992 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 vi = vector <int>;
using pii = pair <int, int>;
#define pb push_back
#define F first
#define S second
#define N 200005
int n, k, ans = N, sz[N], mx[N], centroid;
map <int, int> dist;
bool used[N];
vector <pii> edg[N];
void get_size(int u, int p){
sz[u] = 1;
mx[u] = 0;
for (pii v : edg[u])
if (v.F != p && !used[v.F]){
get_size(v.F, u);
mx[u] = max(mx[u], sz[v.F]);
sz[u] += sz[v.F];
}
mx[u] = max(mx[u], n - sz[u]);
}
void get_centroid(int u, int p){
for (pii v : edg[u])
if (v.F != p && !used[v.F])
get_centroid(v.F, u);
if (mx[u] <= (n + 1) / 2) centroid = u;
}
# | 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... |