# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116227 | Just_Solve_The_Problem | Synchronization (JOI13_synchronization) | C++11 | 326 ms | 21236 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 = (int)2e5 + 7;
vector<int> gr[N];
vector<pair<int, int>> ed;
int n, m, q;
int tin[N], tout[N], pos[N];
int st[N];
int tiktak;
int tree[N * 4], ans[N], lst[N];
void dfs(int v, int pr) {
tin[v] = ++tiktak;
pos[tiktak] = v;
for (int id : gr[v]) {
int to = ed[id].first + ed[id].second - v;
if (to == pr) continue;
dfs(to, v);
}
tout[v] = ++tiktak;
}
void build(int v, int l, int r) {
if (l == r) {
tree[v] = tout[pos[l]];
return ;
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... |