# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1117430 | FucKanh | Synchronization (JOI13_synchronization) | C++14 | 285 ms | 35716 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 ll long long
#define int ll
#define pii pair<int,int>
using namespace std;
const int maxn = 1e5 + 2;
const int LG = 18;
int tin[maxn],tout[maxn],h[maxn],active[maxn],val[maxn], valid[maxn];
int pa[maxn][LG + 2];
pii e[maxn];
vector<int> a[maxn];
int n,m,q,T;
void dfs(int u, int par = -1) {
tin[u] = ++T;
for (int i = 1; i <= LG; i++) {
pa[u][i] = pa[pa[u][i-1]][i-1];
}
for (int v : a[u]) if (v!=par) {
pa[v][0] = u;
h[v] = h[u] + 1;
dfs(v,u);
}
tout[u] = ++T;
}
class BIT {
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... |