#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> >graff[100010];
int dist[100010], dist2[100010], anc[100010];
bool check[100010], check2[100010];
vector<int>LongestPaths;
int v, d;
void dfs(int cvor)
{
check[cvor]=true;
if(dist[cvor]>d){v=cvor; d=dist[cvor];}
for(int i=0; i<graff[cvor].size(); i++)
{
if(!check[graff[cvor][i].first])
{
dist[graff[cvor][i].first]=dist[cvor]+graff[cvor][i].second;
dfs(graff[cvor][i].first);
}
}
}
void dfs2(int cvor)
{
check2[cvor]=true;
if(dist2[cvor]>d){v=cvor; d=dist2[cvor];}
for(int i=0; i<graff[cvor].size(); i++)
{
if(!check2[graff[cvor][i].first])
{
dist2[graff[cvor][i].first]=dist2[cvor]+graff[cvor][i].second;
anc[graff[cvor][i].first]=cvor;
dfs2(graff[cvor][i].first);
}
}
}
int travelTime(int N, int M, int L, int A[], int B[], int T[])
{
for(int i=0; i<M; i++)
{
graff[A[i]].push_back({B[i], T[i]});
graff[B[i]].push_back({A[i], T[i]});
}
for(int i=0; i<N; i++)
{
if(!check[i])
{
v=i; dfs(i);
d=0; int pp=v;
dfs2(v);
int predak=v;
vector<int>putic;
while(predak!=pp){putic.push_back(predak); predak=anc[predak];}
putic.push_back(predak);
int rez=INT_MAX;
for(int j=0; j<putic.size(); j++)
{
//cout<<putic[j]<<" ";
int bg=putic[j];
rez=min(rez, max(dist2[bg], d-dist2[bg]));
}
LongestPaths.push_back(rez);
d=0; v=0;
}
}
sort(LongestPaths.begin(), LongestPaths.end());
int lngt=LongestPaths.size()-1;
return max(LongestPaths[lngt]+L+LongestPaths[lngt-1], LongestPaths[lngt-1]+LongestPaths[lngt-2]+2*L);
}
/*int main()
{
int N, M, L;
cin>>N>>M>>L;
int A[100], B[100], T[100];
for(int i=0; i<M; i++)cin>>A[i]>>B[i]>>T[i];
cout<<travelTime(N, M, L, A, B, T);
}
/*12 8 2
0 8 4
8 2 2
2 7 4
5 11 3
5 1 7
1 3 1
1 9 5
10 6 3*/
Compilation message
dreaming.cpp:82:1: warning: "/*" within comment [-Wcomment]
82 | /*12 8 2
|
dreaming.cpp: In function 'void dfs(int)':
dreaming.cpp:15:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
15 | for(int i=0; i<graff[cvor].size(); i++)
| ~^~~~~~~~~~~~~~~~~~~
dreaming.cpp: In function 'void dfs2(int)':
dreaming.cpp:29:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
29 | for(int i=0; i<graff[cvor].size(); i++)
| ~^~~~~~~~~~~~~~~~~~~
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:59:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
59 | for(int j=0; j<putic.size(); j++)
| ~^~~~~~~~~~~~~
/usr/bin/ld: /tmp/ccQw5c7F.o: in function `main':
grader.c:(.text.startup+0xd1): undefined reference to `travelTime'
collect2: error: ld returned 1 exit status
