#include "dreaming.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define ll long long
using pii = pair <int, int>;
using vi = vector <int>;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define ook order_of_key
#define fbo find_by_order
#define sq(x) (x) * (x)
#define N 100005
vector <pii> edg[N];
multiset <int> se;
ll dist, dp[N], dp1[N], up[N], up1[N];
int vis[N];
void dfs(int u, ll mx){
vis[u] = 1;
up[u] = mx;
for (pii v : edg[u])
if (!vis[v.F]){
dfs(v.F, max(mx, dp[u]) + v.S);
dp[u] = max(dp[u], dp[v.F] + v.S);
}
}
void dfs1(int u, ll mx){
vis[u] = 2;
up1[u] = mx;
for (int i = edg[u].size() - 1;i >= 0;i--){
pii v = edg[u][i];
if (vis[v.F] < 2){
dfs1(v.F, max(mx, dp1[u]) + v.S);
dp1[u] = max(dp1[u], dp1[v.F] + v.S);
}
}
dist = min(dist, max({dp[u], dp1[u], up[u], up1[u]}));
}
int travelTime(int n, int m, int L, int A[], int B[], int T[]) {
for (int i = 0;i < m;i++){
edg[A[i]].pb(mp(B[i], T[i]));
edg[B[i]].pb(mp(A[i], T[i]));
}
for (int i = 0;i < n;i++)
if (!vis[i]){
dist = 1e12;
dfs(i, 0);
dfs1(i, 0);
se.insert(dist);
}
dist = 0;
while (se.size() > 1){
ll dist1, dist2;
dist1 = *se.begin();
se.erase(se.begin());
dist2 = *se.begin();
se.erase(se.begin());
dist = max(dist1 + dist2 + L, dist);
se.insert(max(max(dist1, dist2), min(dist1, dist2) + L));
}
return dist;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
63 ms |
13816 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
63 ms |
13816 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
63 ms |
13816 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
55 ms |
11284 KB |
Output is correct |
2 |
Incorrect |
58 ms |
11324 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
63 ms |
13816 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
63 ms |
13816 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |