#include <bits/stdc++.h>
#include "traffic.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL)
#define int long long
#define deb1(x) cout << #x << "=" << x << endl;
#define deb2(x, y) cout << #x << "=" << x << ", " << #y << "=" << y << endl;
vector<int> adj[1000000];
int tot_peo[1000000], ans[1000000], peo[1000000];
// refer kartik arora's dp on trees youtube videos
// idea is taken from his tree distance ii video
void dfs1(int u, int p = -1) {
tot_peo[u] = peo[u];
for (int v : adj[u])
if (v != p) {
dfs1(v, u);
tot_peo[u] += tot_peo[v];
}
}
void dfs2(int u, int p = -1) {
ans[u] = 0;
for (int v : adj[u])
if (v != p)
ans[u] = max(ans[u], tot_peo[v]);
if (p != -1)
ans[u] = max(ans[u], tot_peo[0] - tot_peo[u]);
for (int v : adj[u])
if (v != p)
dfs2(v, u);
}
int LocateCentre(int N, int P[], int S[], int D[]) {
for (int i = 0; i < N - 1; i++) {
adj[S[i]].push_back(D[i]);
adj[D[i]].push_back(S[i]);
}
for (int i = 0; i < N; i++)
peo[i] = P[i];
dfs1(0);
dfs2(0);
int mn = 1e18;
for (int i = 0; i < N; i++)
mn = min(mn, ans[i]);
return mn;
}
// signed main() {
// FAST;
// #ifndef ONLINE_JUDGE
// freopen("../input1.txt", "r", stdin);
// freopen("../output1.txt", "w", stdout);
// #endif
// int N = 5;
// int P[N] = {10, 10, 10, 20, 20};
// int S[N] = {0, 1, 2, 3};
// int D[N] = {2, 2, 3, 4};
// cout << LocateCentre(N, P, S, D) << endl;
// return 0;
// }
Compilation message
/usr/bin/ld: /tmp/ccHHAS2G.o: in function `main':
grader.cpp:(.text.startup+0xe1): undefined reference to `LocateCentre(int, int*, int*, int*)'
collect2: error: ld returned 1 exit status
