# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
58776 | Sherazin | Race (IOI11_race) | C++14 | 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 "race.h"
#include <bits/stdc++.h>
#define pii pair<int, int>
#define x first
#define y second
using namespace std;
const int N = 2e5 + 5;
int n, k;
int ans = -1, centroid, mxnode, tot, cnt;
int dep[N], path[N], dp[N];
vector<vector<pii> > g(N);
bitset<N> chk;
int subtree(int u, int p) {
for(pii v : g[u]) if(!chk[v.x] && v.x != p) {
dep[u] += subtree(v.x, u);
}
return ++dep[u];
}
void centdecomp(int u, int p) {
int ret = all - dep[u];
for(pii v : g[u]) if(!chk[v.x] && v.x != p) {
centdecomp(v.x, u);
ret = max(ret, dep[v.x]);
}