# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
393936 | KoD | Duathlon (APIO18_duathlon) | C++17 | 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.
const auto calc = RecLambda([&](auto&& dfs, const usize u) -> void {
subtree[u] = (u < N);
for (const auto v: bctree[u]) {
dfs(v);
subtree[u] += subtree[v];
if (u >= N) {
ans -= (u64) bctree[u].size() * subtree[v] * (subtree[v] - 1);
}
}
});