/*input
12 8 2
0 8 4
8 2 2
2 7 4
5 1 13
5 1 7
1 3 1
1 9 5
10 6 3
*/
//#include "dreaming.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
#define ll long long
#define ld long double
#define pii pair<int,int>
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define MP make_pair
const ll INF64=4e12;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll mult(ll a,ll b){
return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
if(b<=0) return 1;
ll res=1LL;
while(b){
if(b&1){
res=(res*a)%MOD;
}
a=(a*a)%MOD;
b>>=1;
}
return res;
}
const ll maxn=1e5+5;
const ll maxlg=__lg(maxn)+2;
vector<pii> v[maxn];
bool vis[maxn];
int st,mx;
void dfs(int u,int p,int d){
vis[u]=1;
if(d>mx){
mx=d;
st=u;
}
for(pii x:v[u]){
if(x.f!=p){
dfs(x.f,u,d+x.s);
}
}
}
vector<pii> cent;
void dfs2(int u,int p,vector<int> &pth){
if(u==st){
cent.pb({mx,pth[sz(pth)/2]});
return;
}
for(pii x:v[u]){
if(x.f!=p){
pth.pb(x.f);
dfs2(x.f,u,pth);
pth.pop_back();
}
}
}
vector<int> pth;
int travelTime(int n, int m, int l, int A[], int B[], int T[]) {
REP(i,m){
v[A[i]].pb({B[i],T[i]});
v[B[i]].pb({A[i],T[i]});
}
int ans=0;
REP(i,n){
if(!vis[i]){
mx=0;
dfs(i,-1,0);
mx=0;
int pv=st;
dfs(st,-1,0);
dfs2(pv,-1,pth);
MXTO(ans,mx);
}
}
sort(ALL(cent));
REP(i,sz(cent)-1){
v[cent.back().s].pb({cent[i].f,l});
}
dfs(0,-1,0);
MXTO(ans,mx);
return ans;
}
Compilation message
/tmp/ccpe0sQT.o: In function `main':
grader.c:(.text.startup+0xa2): undefined reference to `travelTime'
collect2: error: ld returned 1 exit status
