# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
217212 | DodgeBallMan | Capital City (JOI20_capital_city) | C++14 | 1102 ms | 41208 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>
using namespace std;
const int N = 2e5+5;
int n, k, ans = 1e9;
int C[N], cnt[N];
vector<int> g[N];
int sz[N];
bitset<N> chk;
int get_sz(int u, int p) {
sz[u] = 1;
for(int v : g[u]) if(v != p && !chk[v])
sz[u] += get_sz(v, u);
return sz[u];
}
int find_cen(int u, int p, int all, int &ret) {
int mx = all - sz[u];
for(int v : g[u]) if(v != p && !chk[v])
mx = max(mx, find_cen(v, u, all, ret));
if(mx <= (all + 1) / 2) ret = u;
return sz[u];
}
int par[N], used[N];
vector<int> col[N];
Compilation message (stderr)
# | 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... |