# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
85406 | farukkastamonuda | Birthday gift (IZhO18_treearray) | C++14 | 1583 ms | 176468 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 mp make_pair
#define lo long long
#define inf 1000000000
#define md 1000000007
#define pb push_back
#define li 200005
#define mid (start+end)/2
using namespace std;
int n,m,q,x,y,dep[li],baba[24][li],A[li],deg;
vector<int> v[li];
set<int> s[li],t[li];
void dfs(int node,int ata,int d){
baba[0][node]=ata;
dep[node]=d;
for(int i=0;i<(int)v[node].size();i++){
int go=v[node][i];
if(go==ata) continue;
dfs(go,node,d+1);
}
}
void b_lca(){
for(int i=1;i<=20;i++){
for(int j=1;j<=n;j++){
baba[i][j]=baba[i-1][baba[i-1][j]];
}
}
}
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... |