# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
381833 | saarang123 | Synchronization (JOI13_synchronization) | C++17 | 304 ms | 24044 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 mxn = 100 * 1000 + 3, lgn = 19;
int tin[mxn], tout[mxn], bit[mxn], up[mxn][lgn], info[mxn], last[mxn];
bool active[mxn];
vector<int> g[mxn];
int n, m, q, tx = 1;
void upd(int x, int v) {
for(; x <= n; x += (x & -x))
bit[x] += v;
}
int qry(int x) {
int res = 0;
for(; x; x -= (x & -x))
res += bit[x];
return res;
}
void dfs(int v, int p = 0) {
up[v][0] = p;
info[v] = 1;
tin[v] = tx++;
for(int i = 1; i < lgn && up[v][i - 1]; i++)
up[v][i] = up[up[v][i - 1]][i - 1];
for(int u : g[v]) if(u != p) dfs(u, v);
tout[v] = tx;
}
# | 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... |