# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
409112 | vuhoanggiap | Synchronization (JOI13_synchronization) | C++17 | 368 ms | 25444 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>
#define pb push_back
using namespace std;
const int maxN = 1e5 + 5, maxM = 2e5 + 5;
int n, m, q;
vector<int> adj[maxN];
int A[maxM], B[maxM];
bool state[maxM];
int euler;
int s[maxN], e[maxN];
int jump[maxN][22];
void dfs(int u, int p) {
s[u] = ++euler;
jump[u][0] = p;
for(int i = 1; i < 20; i++)
jump[u][i] = jump[jump[u][i - 1]][i - 1];
for(auto v : adj[u])
if(v != p)
dfs(v, u);
e[u] = euler;
}
int fen[maxN];
void update(int i, int val) { while(i <= n + 1) fen[i] += val, i += (i & (-i)); }
int query(int i) { int ret = 0; while(i) ret += fen[i], i -= (i & (-i)); return ret; }
# | 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... |