#include "factories.h"
#include <bits/stdc++.h>
using namespace std;
long long int f[500005];
int n, d[500005], tin[500005], b[2000005], l[2000005], z = 0;
vector<int> gg[500005], g[500005];
int p[500005][20], pp[2000005][22];
void bfs(int x) {
queue<int> q;
q.push(x);
p[x][0] = x;
f[x] = d[x] = 0;
while (!q.empty()) {
int u = q.front();
q.pop();
for (int j = 1; j <= 19; j++) {
p[u][j] = p[p[u][j - 1]][j - 1];
if (p[u][j] == 0) break;
}
for (int i = 0; i < g[u].size(); i++) {
int v = g[u][i];
if (d[u] + 1 < d[v]) {
d[v] = d[u] + 1;
f[v] = f[u] + gg[u][i];
p[v][0] = u;
q.push(v);
}
}
}
}
void dfs(int x, int p) {
b[++z] = x;
pp[z][0] = x;
tin[x] = z;
for (int w : g[x]) {
if (w == p) continue;
dfs(w, x);
b[++z] = x;
pp[z][0] = x;
}
b[++z] = x;
pp[z][0] = x;
}
void Init(int N, int A[], int B[], int D[]) {
n = N;
for (int i = 0; i < 500000; i++) {
f[i] = 999999999999999999;
d[i] = n * 2;
}
for (int i = 0; i < n - 1; i++) {
int u = A[i], v = B[i], w = D[i];
g[u].push_back(v);
g[v].push_back(u);
gg[u].push_back(w);
gg[v].push_back(w);
}
bfs(0);
dfs(0, -1);
for (int i = 2; i <= 2000000; i++) l[i] = l[i / 2] + 1;
for (int i = 1; (1 << i) <= z; i++) {
for (int j = 1; j <= z - (1 << i) + 1; j++) {
if (d[pp[j][i - 1]] < d[pp[j + (1 << (i - 1))][i - 1]]) pp[j][i] = pp[j][i - 1];
else pp[j][i] = pp[j + (1 << (i - 1))][i - 1];
}
}
}
int lca(int u, int v) {
int x = tin[u], y = tin[v];
if (y <= x) swap(x, y);
int g = l[y - x + 1];
int h = pp[x][g], k = pp[y - (1 << g) + 1][g];
if (d[h] < d[k]) return h;
return k;
}
long long int check(int u, int v) {
return f[u] + f[v] - f[lca(u, v)] * 2;
}
long long int Query(long long int S, int X[], long long int T, int Y[]) {
if (S * T > 100000) {
vector<long long int> ff(n, 999999999999999999);
vector<bool> dda(n, 0), dd(n, 0);
for (int i = 0; i < T; i++) {
dda[Y[i]] = 1;
}
priority_queue<pair<long long int, long long int>> q;
for (int i = 0; i < S; i++) {
q.push({0, X[i]});
ff[X[i]] = 0;
}
while (!q.empty()) {
int u = q.top().second;
q.pop();
if (dd[u] == 1) continue;
dd[u] = 1;
if (dda[u] == 1) return ff[u];
for (int i = 0; i < g[u].size(); i++) {
int v = g[u][i], w = gg[u][i];
if (ff[u] + w < ff[v]) {
ff[v] = ff[u] + w;
q.push({-ff[v], v});
}
}
}
}
long long int res = 999999999999999999;
for (int i = 0; i < S; i++) {
for (int j = 0; j < T; j++) {
res = min(res, check(X[i], Y[j]));
}
}
return res;
}
Compilation message
factories.cpp: In function 'void bfs(int)':
factories.cpp:20:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
20 | for (int i = 0; i < g[u].size(); i++) {
| ~~^~~~~~~~~~~~~
factories.cpp: In function 'long long int Query(long long int, int*, long long int, int*)':
factories.cpp:96:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
96 | for (int i = 0; i < g[u].size(); i++) {
| ~~^~~~~~~~~~~~~
/usr/bin/ld: /tmp/ccBDSZi1.o: in function `main':
grader.cpp:(.text.startup+0x412): undefined reference to `Query(int, int*, int, int*)'
collect2: error: ld returned 1 exit status
