# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
120350 | IOrtroiii | Synchronization (JOI13_synchronization) | C++14 | 1540 ms | 24240 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 = 100100;
int n, m, q;
vector<int> g[N];
int dep[N], par[17][N];
int tin[N], tout[N], tt;
void dfs(int v) {
tin[v] = ++tt;
for (int i = 1; i < 17; ++i) {
par[i][v] = par[i - 1][par[i - 1][v]];
}
for (int u : g[v]) {
if (u != par[0][v]) {
dep[u] = dep[v] + 1;
par[0][u] = v;
dfs(u);
}
}
tout[v] = tt;
}
int T[N << 2];
#define mid ((l + r) >> 1)
void add(int v, int l, int r, int L, int R, int val) {
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... |