# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
533398 | Marceantasy | Synchronization (JOI13_synchronization) | C++17 | 501 ms | 26288 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;
#define ll long long
#define ar array
const int mxN = 2e5+1, M = 1e9+7;
int n, m, q;
bool active[mxN];
vector<int> adj[mxN];
pair<int, int> edges[mxN];
int info[mxN], last_sync[mxN];
int timer = 0, tin[mxN], tout[mxN];
int up[20][mxN];
int bit[mxN];
void dfs(int u = 0, int p = -1){
up[0][u] = p;
for(int i = 1; i<20 && up[i-1][u]!=-1; ++i){
up[i][u] = up[i-1][up[i-1][u]];
}
info[u] = 1;
tin[u] = timer++;
for(int v : adj[u]){
if(v == p) continue;
dfs(v, u);
}
# | 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... |