# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
547925 | fhvirus | Synchronization (JOI13_synchronization) | C++17 | 466 ms | 19868 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 kL = 17;
const int kN = 100'001;
const int kM = 200'002;
int N, M, Q;
int X[kN], Y[kN];
vector<int> aj[kN];
int in[kN], ou[kN], tot;
int jp[kL][kN];
void dfs(int u, int p) {
jp[0][u] = p;
in[u] = ++tot;
for (const int& v: aj[u]) {
if (v == p) continue;
dfs(v, u);
}
ou[u] = tot;
}
int val[kN];
void mo(int p, int v) {
for (; p <= N; p += p & -p)
val[p] += v;
}
int qu(int p) {
int r = 0;
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... |