# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
445492 | ivan_tudor | Mergers (JOI19_mergers) | C++14 | 98 ms | 75432 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 = 500005;
vector<int> gr[N];
int par[20][N];
int in[N], out[N];
int sum[N];
int frv[N];
void dfs_prec(int nod, int dad,int &cur){
par[0][nod] = dad;
in[nod] = ++cur;
for(auto x:gr[nod]){
if(x != dad){
dfs_prec(x, nod, cur);
}
}
out[nod] = cur;
}
void prec_lca(int n){
for(int log = 1; log < 20; log ++){
for(int nod = 1; nod <=n; nod++)
par[log][nod] = par[log -1][par[log - 1][nod]];
}
}
bool is_dad(int nod, int son){
if(in[nod]<= in[son] && out[nod] <= out[son])
return true;
return false;
}
int get_lca(int a, int b){
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |