#include "dreaming.h"
#include <bits/stdc++.h>
#define sc second
#define fr first
#define mk make_pair
#define pb push_back
#define int long long
using namespace std;
const int N = (1e6 + 5);
const int inf = (1e9 + 7);
int n,m,l;
int par[N],dis[N],u[N];
int mx = -1;
int mxx;
int cur;
vector <pair<int,int> > g[N];
vector <int> ans;
void dfs (int v,int d = 0,int p = -1) {
u[v] = 1;
par[v] = p;
dis[v] = d;
if (mx < d) mx = d,cur = v;
for (auto to : g[v]) {
if (to.fr != p) dfs(to.fr,d + to.sc,v);
}
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
n = N,m = M,l = L;
for (int i = 0; i < m; i ++) {
A[i] ++;
B[i] ++;
g[A[i]].pb(mk(B[i],T[i]));
g[B[i]].pb(mk(A[i],T[i]));
}
for (int i = 1; i <= n; i ++) {
if (!u[i]) {
cur = 0,mx = -1;
dfs(i);
mxx = max(mxx,mx);
int c = cur,res = inf;
cur = 0,mx = -1;
dfs(c);
c = cur;
mxx = max(mxx,mx);
while (c != -1) {
res = min(res,max(dis[c],dis[cur] - dis[c]));
c = par[c];
}
ans.pb(res);
}
}
sort(ans.rbegin(),ans.rend());
if (ans.size() > 1) return max(mxx,ans[0] + ans[1] + l);
return mxx;
}
Compilation message
/tmp/cc6diOGd.o: In function `main':
grader.c:(.text.startup+0xa2): undefined reference to `travelTime'
collect2: error: ld returned 1 exit status
