# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
414355 | ritul_kr_singh | Capital City (JOI20_capital_city) | C++17 | 708 ms | 34260 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 int long long
#define sp << ' ' <<
#define nl << '\n'
const int MAXN = 2e5;
int n, k, color[MAXN], par[MAXN], s[MAXN], ans = MAXN;
vector<int> g[MAXN], h[MAXN];
bitset<MAXN> r, vis, bad;
void calcSize(int u){
s[u] = 1;
for(int v : g[u]) if(!s[v]) calcSize(v), s[u] += s[v];
}
int find(int u, int p, int sz){
bool f = 1;
while(f){
f = 0;
s[p] -= s[u], s[u] = sz;
for(int v : g[u]){
if(!r[v] && s[v] > sz/2){
p = u, u = v;
f = 1;
break;
}
}
}
# | 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... |