# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
543136 | sidon | Spring cleaning (CEOI20_cleaning) | C++17 | 184 ms | 26272 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 Z = 1e5, B = 17;
int N, Q;
vector<int> g[Z], h[Z];
int p[Z][B], L[Z], R[Z], s[Z], d[Z], dfsTimer, rt, leafCnt, ext;
void init(int u) {
L[u] = dfsTimer++;
for(int i = 0; i + 1 < B; ++i)
p[u][i+1] = p[p[u][i]][i];
s[u] = size(g[u]) > 1;
leafCnt += !s[u];
for(const int &v : g[u]) if(v != p[u][0]) {
p[v][0] = u;
d[v] = d[u] + 1;
init(v);
s[u] ^= s[v] ^ 1;
}
if(u != rt) ext += s[u];
R[u] = dfsTimer++;
}
void dfs(int u) {
for(const int &v : g[u]) if(v != p[u][0])
s[v] += s[u], dfs(v);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |