# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1156917 | tungkhoa08 | Railway (BOI17_railway) | C++17 | 1114 ms | 589824 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int>i2;
#define fi first
#define se second;
#define pb push_back;
int gu[100005],gv[100005],n,m,k,h[100005],dp[100005][30];
vector <int>kq,g[100005],luu[100005];
set <int> s[100005];
void dfs(int u,int pa){
for (int v:g[u]){
if (v!=pa){
h[v]=h[u]+1;
dp[v][0]=u;
dfs(v,u);
}
}
}
void ktao(){
for (int i=1;(1<<i)<=n;i++){
for (int u=1;u<=n;u++) dp[u][i]=dp[dp[u][i-1]][i-1];
}
}
int lca(int u,int v){
if (h[u]<h[v]) swap(u,v);
if (h[u]!=h[v]){
int k=h[u]-h[v];
for (int i=20;i>=0;i--){
int ok=(k>>i)&1;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |