# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1125886 | nuutsnoynton | Synchronization (JOI13_synchronization) | C++20 | 1933 ms | 38616 KiB |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N = 2e5 + 2;
ll etseg[N], huu[N], out[N], par[20][N], is_connected[N], in[N],val[N], depth[N], last_connected[N];
ll Sum[16 * N], Has[16 * N], n;
vector < ll > adj[N];
ll timer = 0;
void Go(ll cur, ll parent) {
ll i;
par[0][cur] = parent;
for (i = 1; i <= 18; i++) par[i][cur] = par[i - 1][par[i - 1][cur]];
is_connected[cur] = 0;
in[cur] = ++timer;
// par[cur] = parent;
for ( ll child : adj[cur]) {
if ( child == parent) continue;
depth[child] = depth[cur] + 1;
Go(child, cur);
}
out[cur] = timer;
return ;
}
# | 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... |