# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1112813 | ezzzay | Putovanje (COCI20_putovanje) | C++14 | 165 ms | 40520 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;
#define int long long
#define ff first
#define ss second
#define pb push_back
const int N=3e5+5;
vector<pair<int,pair<int,int> > >v [N] ;
int ans=0;
int dp[N];
int par[32][N];
int sbtr[N];
int dist[N];
void dfs(int a, int p){
for(auto k:v[a]){
int b= k.ff;
if(b==p)continue;
par[0][b]=a;
dist[b]=dist[a]+1;
dfs(b,a);
}
}
int lca(int a, int b){
if(dist[b]>dist[a])swap(a,b);
int x=dist[a]-dist[b];
for(int i=0;i<=18;i++){
if(x & (1<<i)){
a=par[i][a];
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |