# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
549317 | sidon | Synchronization (JOI13_synchronization) | C++17 | 269 ms | 24592 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 Z = 1e5+2, B = 17;
int N, M, Q, last[Z], L[Z], R[Z], p[Z][B], ans[Z], dfsTimer;
array<int, 2> h[Z];
bool state[Z];
vector<int> g[Z];
void dfs(int u) {
L[u] = ++dfsTimer;
for(int i = 0; i + 1 < B; ++i)
p[u][i+1] = p[p[u][i]][i];
for(const int &v : g[u]) if(v != p[u][0])
p[v][0] = u, dfs(v);
R[u] = 1+dfsTimer;
}
int F[Z];
int get(int i) {
int v = 0;
for(; i >= 1; i -= i&-i) v += F[i];
return v;
}
void add(int i, int v) {
for(; i <= N; i += i&-i) F[i] += v;
}
# | 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... |