# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
113058 | maruii | Synchronization (JOI13_synchronization) | C++14 | 269 ms | 17912 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;
vector<int> edge[100001];
int dfn[100001], efn[100001], ifn[100001], dfnn;
void dfs(int x, int p) {
dfn[x] = ++dfnn;
ifn[dfnn] = x;
for (auto i: edge[x]) {
if (i != p) dfs(i, x);
}
efn[x] = dfnn;
}
const int SIZE = 1 << 17;
struct ST {
int V[SIZE << 1];
void init(int nn, int s, int e) {
if (s == e) {
V[nn] = efn[ifn[s]];
return;
}
int m = s + e >> 1;
init(nn << 1, s, m);
init(nn << 1 | 1, m + 1, e);
V[nn] = max(V[nn << 1], V[nn << 1 | 1]);
}
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... |