# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
968616 | Lecorbio | Synchronization (JOI13_synchronization) | C++14 | 361 ms | 25336 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 fi first
#define se second
#define sajz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 1e5+7, P = 20, B = 1<<17;
int n, m, q, timer = -1, tin[N], tout[N], up[N][P];
int val[N], last[N], ind[N], tree[B*2];
pair<int,int> edge[N];
vector<int> g[N];
bool active[N];
void dfs(int v, int par){
up[v][0] = par;
for (int i=1; i<P; i++) up[v][i] = up[up[v][i-1]][i-1];
tin[v] = ++timer;
val[v] = 1;
for (auto u : g[v]){
if (u == par) continue;
dfs(u, v);
}
tout[v] = timer;
}
void update(int v, int a, int b, int p, int k, int x){
if (a > k || b < p) return;
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... |