# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68317 | top34051 | Synchronization (JOI13_synchronization) | C++17 | 1802 ms | 96772 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;
#define pii pair<int,int>
#define X first
#define Y second
const int maxn = 1e5 + 5;
int n,m,q;
vector<pii> way[maxn];
pii e[maxn];
int h[maxn], cur, st[maxn], ft[maxn];
set<pii> seg[maxn*4];
int open[maxn];
int res[maxn], wow[maxn];
void dfs(int u, int last) {
h[u] = h[last] + 1;
st[u] = ++cur;
for(auto tmp : way[u]) {
int v = tmp.X, id = tmp.Y;
if(v==last) continue;
e[id] = {u,v};
dfs(v,u);
}
ft[u] = cur;
}
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... |