# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
746172 | JooDdae | Race (IOI11_race) | C++17 | 0 ms | 0 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>
#define int long long
#define ll long long
#define double long double
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
using namespace std;
using pii = pair<int, int>;
using ti3 = tuple<int, int, int>;
const int MAX = 200010, INF = (int) 1e9 + 7;
int n, k, sz[MAX], cPar[MAX], visited[MAX], ans = INF;
vector<pii> g[MAX];
map<int, int> mp;
int getSize(int cur, int p) {
sz[cur] = 1;
for (pii nxt: g[cur]) {
if (nxt.fi != p && !visited[nxt.fi]) sz[cur] += getSize(nxt.fi, cur);
}
return sz[cur];
}
int getCentroid(int cur, int p, int cap) {
for (pii nxt: g[cur]) {
if (nxt.fi != p && !visited[nxt.fi] && sz[nxt.fi] * 2 > cap) {
return getCentroid(nxt.fi, cur, cap);
}
}
return cur;