#include "factories.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FF first
#define SS second
#define all(a) a.begin(), a.end()
#define mod (ll)(1000000007)
//#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx,avx2")
// #define MAX_N 500000
// #define MAX_Q 100000
// #define MAX_SUM_ST 1000000
// #define MAX_VALUE 1000000000
// static int N, Q;
// static int A[MAX_N], B[MAX_N], D[MAX_N];
// static int S[MAX_N];
// static int T[MAX_N];
// static int X[MAX_SUM_ST];
// static int Y[MAX_SUM_ST];
// static int Qx[MAX_N];
// static int Qy[MAX_N];
const ll inf=1e15, lg=19;
int n;
vector<ll>Dis;
vector<int>dpth;
vector<vector<int>>BB, AA, up;
vector<vector<ll>>Lca;
inline void pre(){
//Dis.clear(), dpth.clear(), AA.clear(), up.clear(), Lca.clear(), BB.clear();
Dis.resize(n, inf), dpth.resize(n, 2*n), AA.resize(n), BB.resize(n), up.resize(n, vector<int>(lg+1)), Lca.resize(n, vector<ll>(lg+1));
}
inline void bfs(int ind){
queue<int>q;
q.push(ind);
up[ind][0]=ind, Lca[ind][0]=0;
Dis[ind]=dpth[ind]=0;
while(!q.empty()){
int u=q.front();
q.pop();
for(int j=1;j<=lg;j++){
up[u][j]=up[up[u][j-1]][j-1];
Lca[u][j]=Lca[u][j-1]+Lca[up[u][j-1]][j-1];
if(up[u][j]==0)
break;
}
for(int i=0;i<AA[u].size();i++){
int v=AA[u][i];
if(dpth[u]+1<dpth[v]){
dpth[v]=dpth[u]+1, Dis[v]=Dis[u]+BB[u][i];
up[v][0]=u, Lca[v][0]=BB[u][i];
q.push(v);
}
}
}
}
inline ll get_dis(int u, int v){
// u
// v
ll res=0;
if(dpth[u]>dpth[v])
swap(u, v);
for(int j=lg;j>=0;j--){
if(dpth[up[v][j]]>dpth[u])
res+=Lca[v][j], v=up[v][j];
}
if(dpth[u]!=dpth[v])
res+=Lca[v][0], v=up[v][0];
if(u==v)
return res;
for(int j=lg;j>=0;j--){
if(up[u][j]!=up[v][j])
res+=Lca[u][j]+Lca[v][j], u=up[u][j], v=up[v][j];
}
res+=Lca[u][0]+Lca[v][0];
return res;
}
inline void Init(int N, int A[], int B[], int D[]) {
n=N;
pre();
for(int i=0;i<n-1;i++){
int u=A[i], v=B[i], w=D[i];
AA[u].push_back(v);
AA[v].push_back(u);
BB[u].push_back(w);
BB[v].push_back(w);
}
bfs(0);
}
inline long long Query(int S, int X[], int T, int Y[]) {
ll ans=inf;
for(int i=0;i<S;i++){
for(int j=0;j<T;j++){
ans=min(ans, get_dis(X[i], Y[j]));
}
}
return ans;
}
Compilation message
factories.cpp: In function 'void bfs(int)':
factories.cpp:51:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
51 | for(int i=0;i<AA[u].size();i++){
| ~^~~~~~~~~~~~~
/usr/bin/ld: /tmp/cczOOf3g.o: in function `main':
grader.cpp:(.text.startup+0x37d): undefined reference to `Init(int, int*, int*, int*)'
/usr/bin/ld: grader.cpp:(.text.startup+0x412): undefined reference to `Query(int, int*, int, int*)'
collect2: error: ld returned 1 exit status
