# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62088 | FutymyClone | Synchronization (JOI13_synchronization) | C++14 | 577 ms | 69152 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 h[N], st[N], en[N], pos[N], node[4 * N], n, m, q, u[N], v[N], res[N], last[N], state[N];
int cnt = 0;
void input(){
scanf("%d %d %d", &n, &m, &q);
for (int i = 1; i <= n - 1; i++) {
scanf("%d %d", &u[i], &v[i]);
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
h[1] = 0;
memset(state, 0, sizeof(state));
memset(last, 0, sizeof(last));
fill(res + 1, res + n + 1, 1);
}
void dfs (int u, int p) {
st[u] = ++cnt;
pos[st[u]] = u;
for (int v: g[u]) {
if (v == p) continue;
Compilation message (stderr)
# | 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... |