# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
502626 | NintsiChkhaidze | Dreaming (IOI13_dreaming) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "dreaming.h"
#include <bits/stdc++.h>
#define s second
#define f first
#define pb push_back
#define ll long long
using namespace std;
void dfs(int x,ll d,int par){
if (d > D) {I = x,D = d;}
for (int j=0;j<v[x].size();j++){
int to = v[x][j].f,w = v[x][j].s;
if (to == par) continue;
dfs(to,d + w,x);
}
}
ll upd(ll d1,ll d2){
ll d_new = min(max(d1 + l,d2),max(d1,d2 + l));
diameter = max(diameter,d1 + l + d2);
return d_new;
}
int P(int x){
if (x == p[x]) return x;
return p[x] = P(p[x]);
}
void dsu(int u,int v){
int up = P(u),vp = P(v);
if (up == vp) return;
if (up > vp) swap(up,vp);
p[vp] = up;
}
int travelTime(int n, int m, int L, int A[], int B[], int T[]) {
l = L;
for (int i = 0; i < n; i++)
p[i] = i,v[i].clear(),d[i] = 1e9;
for (int i = 0; i < m; i++){
v[A[i]].pb({B[i],T[i]});
v[B[i]].pb({A[i],T[i]});
dsu(A[i],B[i]);
}
for (int i = 0; i < n; i++){
p[i] = P(i);
D = 0;
dfs(i,0,i);
d[p[i]] = min(d[p[i]],D);
if (!fix[p[i]]) fix[p[i]] = 1,vec.pb(p[i]);
}
D = 0;
dfs(vec[0],0,vec[0]);
D = 0;
dfs(I,0,I);
diameter = D;
for (int i=1; i<vec.size(); i++)
d[vec[i]] = upd(d[vec[i - 1]],d[vec[i]]);
return diameter;
}