# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
86970 | FutymyClone | Deblo (COCI18_deblo) | C++14 | 356 ms | 17008 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 = 1e5 + 5;
vector <int> g[N];
int a[N], dp[N], pref[N];
long long f[25][2], ans = 0;
bool visited[N];
void dfs (int u, int p) {
dp[u] = 1;
for (auto v: g[u]) {
if (visited[v] || v == p) continue;
dfs(v, u);
dp[u] += dp[v];
}
}
int find_centroid (int u, int p, int sz) {
for (auto v: g[u]) {
if (v != p && !visited[v] && dp[v] > sz/2) return find_centroid(v, u, sz);
}
return u;
}
void redfs (int u, int p) {
ans += pref[u];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |