#include<bits/stdc++.h>
#ifndef SAMI
#include "dreaming.h"
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"
// ==========================(debug)============================================================================================== //
#ifdef SAMI
#define debug(x) cerr<<#x;cerr<<" ";_printn(x);cerr<<nli;
#define debg() cerr<<nli;
#else
#define debug(x)
#define debg()
#endif
void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
// ==========================(debug)============================================================================================== //
ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;
// ==========================(MOD)=============================================================================================== //
ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }
// ==========================(MOD)=============================================================================================== //
bool f = false;
vector<pi> adj[mx];
ll sr,de,wt;
vi lis;
pi dp[mx];
bool mark[mx];
void dfs(ll u,ll par){
if(mark[u])return;
mark[u] = 1;
lis.push_back(u);
fx(adj[u])
if(x.ff!=par){
dfs(x.ff,u);
}
return;
}
pi dfs2(ll u,ll par,ll d){
pi p = {0,0};
ll pt;
fx(adj[u])
if(x.ff!=par){
pt = dfs2(x.ff,u,d+x.ss).ff + x.ss;
if(pt>p.ff){
p.ss = p.ff;
p.ff = pt;
}else if(pt > p.ss){
p.ss = pt;
}
}
dp[u] = p;
ans = max(ans,p.ff+p.ss);
return p;
}
void dfs3(ll u,ll par,ll d){
// debug(u);
// debug(d);
// debug(dp[u]);
// debug(max(d,dp[u].ff));
res = min(res,max(d,dp[u].ff));
fx(adj[u])
if(x.ff!=par){
if(dp[u].ff == dp[x.ff].ff + x.ss)
dfs3(x.ff,u,max(dp[u].ss,d)+x.ss);
else
dfs3(x.ff,u,max(d,dp[u].ff)+x.ss);
}
return;
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
n = N;
m = M;
tptp = L;
fip(0,m){
cin>>sr>>de;
sr = A[i];
de = B[i];
wt = T[i];
adj[sr].push_back({de,wt});
adj[de].push_back({sr,wt});
}
fip(0,n)mark[i] = 0;
vi v;
ans = -1e9;
fip(0,n){
if(!mark[i]){
lis.clear();
dfs(i,-1);
dfs2(i,-1,0);
res = 1e18;
dfs3(i,-1,0);
debug(res);
v.push_back(res);
debg();
}
debg();
}
srt(v);
reverse(v.begin(),v.end());
debug(v);
if(v.size()>1)
ans = max(ans,v[0]+v[1]+tptp);
if(v.size()>2)
ans = max(ans,v[2]+v[1]+2*tptp);
return ans;
}
#ifdef SAMI
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#ifdef SAMI
freopen("input1.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
freopen("error1.txt", "w", stderr);
#endif // ONLINE_JUDGE
int N,M,L;
cin>>N>>M>>L;
int A[M];
int B[M];
int T[M];
fip(0,M){
cin>>A[i]>>B[i]>>T[i];
}
cout<<travelTime(N,M,L,A,B,T);
cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
#endif
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |