# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
219299 | maruii | Capital City (JOI20_capital_city) | C++14 | 891 ms | 33132 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;
#define eack emplace_back
int N, K, C[200001], ans, A[200001], B[200001];
vector<int> edge[200001];
bool vis[200001];
int sz[200001];
int szf(int x, int p) {
sz[x] = 1;
for (auto i : edge[x]) if (i != p && !vis[i]) sz[x] += szf(i, x);
return sz[x];
}
int get_cen(int x, int p, int t) {
for (auto i : edge[x]) if (i != p && !vis[i] && sz[i] >= t) return get_cen(i, x, t);
return x;
}
bool ban[200001], chk[200001], vis2[200001];
vector<int> clr, vec[200001];
int par[200001];
void dfs(int x, int p) {
par[x] = p;
clr.eack(C[x]);
vec[C[x]].eack(x);
++B[C[x]];
chk[C[x]] = vis2[x] = 0;
for (auto i : edge[x]) if (i != p && !vis[i]) dfs(i, x);
}
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... |