# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
683748 | luka1234 | Birthday gift (IZhO18_treearray) | C++14 | 11 ms | 23796 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 ll long long
#define ff first
#define ss second
#define db double
using namespace std;
int n,m,q;
int a[200001];
vector<int> g[200001];
int A[200001][20];
int p[200001];
int tin[200001],tout[200001];
int timer=0;
int lcas[200001];
set<int> s[200001];
set<int> s2[200001];
set<int>::iterator it;
void dfs(int v,int e){
p[v]=e;
tin[v]=++timer;
for(int i:g[v]){
if(i!=e){
dfs(i,v);
}
}
tout[v]=++timer;
}
void prepare(){
for(int i=1;i<=n;i++){
A[i][0]=p[i];
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... |