# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
379432 | reymontada61 | Synchronization (JOI13_synchronization) | C++14 | 2577 ms | 28268 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;
int n, m, q;
const int MXN = 100005, MXK = 20;
vector<int> adj[MXN];
int par[MXN][MXK];
int eda[MXN], edb[MXN];
int depth[MXN];
int st_start[MXN], st_end[MXN];
int ti = 1;
void dfs(int node, int pa, int dep) {
depth[node] = dep;
par[node][0] = pa;
st_start[node] = ti;
ti++;
for (int i=1; i<MXK; i++) {
par[node][i] = par[par[node][i-1]][i-1];
}
for (auto x: adj[node]) {
if (x == pa) continue;
dfs(x, node, dep+1);
}
st_end[node] = ti;
ti++;
}
# | 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... |