#include "dreaming.h"
#include <bits/stdc++.h>
#define y second
#define x first
#define ll long long int
#define pb push_back
#define pii pair<int,int>
using namespace std;
const int N=1e5+7;
vector<pair<int,int> > adj[N];
bool vis[N];
void dfs(int node,int p,int length,pii &ans){
vis[node]=1;
for(auto vertice:adj[node]) {
if(vertice.x==p) {
continue;
}
dfs(vertice.x,node,length+vertice.y,ans);
}
if(length>ans.y) {
ans.x=node;
ans.y=length;
}
}
bool fn(int s,int e,int p,vector<int> &path){
if(s==e) {
return true;
}
for(auto v:adj[s]) {
if(v.x==p) continue;
if(fn(v.x,e,s,path)) {
path.push_back(v.x);
return true;
}
}
return false;
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
int n=N;
int m=M;
int l=L;
vector<int> radius;
map<pair<int,int>,int> cost;
for(int i=0; i<M; i++) {
int u=A[i];
int v=B[i];
int w=T[i];
adj[u].pb({v,w});
adj[v].pb({u,w});
cost[{u,v}]=cost[{v,u}]=w;
}
int ans=0;
vector<int> a;
for(int i=0; i<N; i++) {
if(vis[i]) continue;
pii s={-1,-1};
dfs(1, -1, 0,s );
pii e={-1,-1};
dfs(s.x,-1,0,e);
vector<int> path;
fn(s.x,e.x,-1,path);
path.push_back(s.x);
int cur=e.y;
int c=e.y;
ans=max(ans,e.s);
for(int j=1; j<(int)path.size(); j++) {
cur-=cost[{path[j],path[j-1]}];
c=min(c,max(cur,e.y-cur));
}
a.push_back(c);
}
sort(a.rbegin(),a.rend());
if(a.size()>1) {
ans=max(ans,a[0]+a[1]+L);
}
if(a.size()>2) {
ans=max(ans,a[1]+a[2]+2*L);
}
return ans;
}
Compilation message
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:65:17: error: 'struct std::pair<int, int>' has no member named 's'
ans=max(ans,e.s);
^
dreaming.cpp:39:6: warning: unused variable 'n' [-Wunused-variable]
int n=N;
^
dreaming.cpp:40:6: warning: unused variable 'm' [-Wunused-variable]
int m=M;
^
dreaming.cpp:41:6: warning: unused variable 'l' [-Wunused-variable]
int l=L;
^
