# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
950843 | Ahmed57 | Synchronization (JOI13_synchronization) | C++17 | 334 ms | 25032 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;
int in[100001],outt[100001];
int P[100001][20];
int bit[100001],dep[100001],ans[100001];
int n;vector<int> adj[100001];
int timer =0 ;
void add(int x,int v){
while(x<=n){
bit[x]+=v;
x+=x&-x;
}
}
int sum(int x){
int ret = 0;
while(x>=1){
ret+=bit[x];
x-=x&-x;
}
return ret;
}
void dfs(int x,int pr){
in[x] = ++timer;
P[x][0] = pr;
dep[x] = dep[pr]+1;
for(int j = 1;j<20;j++){
P[x][j] = P[P[x][j-1]][j-1];
}
for(auto j:adj[x]){
# | 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... |