# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
499575 | couplefire | Synchronization (JOI13_synchronization) | C++17 | 268 ms | 24176 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 N = 100005;
int n, m, q, uu[N], vv[N], bit[N], lst[N], ans[N];
vector<int> adj[N];
int up[N][20], tin[N], tout[N], tid;
void upd(int pos, int val){
for(; pos<N; pos=pos|(pos+1))
bit[pos] += val;
}
int query(int pos){
int res = 0;
for(; pos>=0; pos=(pos&(pos+1))-1)
res += bit[pos];
return res;
}
void dfs(int v, int p){
tin[v] = tid++;
up[v][0] = p;
for(int i = 1; i<20; ++i)
up[v][i] = up[v][i-1]==-1?-1:up[up[v][i-1]][i-1];
for(auto u : adj[v])
if(u!=p) dfs(u, v);
tout[v] = tid;
}
# | 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... |