# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90095 | nicksona | Birthday gift (IZhO18_treearray) | C++14 | 1818 ms | 172592 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 pb push_back
using namespace std;
int n,m,t;
int a,b;
vector <int> v[200001];
int par[200001][41];
int tin[200001],tout[200001];
int mas[200001];
int M=0;
set <int> s[200001];
set <int> s2[200001];
void go (int u,int p){
par[u][0]=p;
tin[u]=++M;
for (int i=1;i<=30;i++){
par[u][i]=par[par[u][i-1]][i-1];
}
for (int i=0;i<v[u].size();i++){
int node=v[u][i];
if (node!=p){
go(node,u);
}
}
tout[u]=++M;
}
bool is_par(int a,int b){
if (tin[a]<=tin[b]&&tout[b]<=tout[a]){
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... |