#include <bits/stdc++.h>
#include "dreaming.h"
using namespace std;
using ll = long long;
constexpr ll INF = 1000000000LL;
ll n, m, q, k, x, y, a, b, c;
int l;
vector< pair<ll, ll> > G[100000];
ll mx[100000], mxu[100000];
bool vis[100000];
struct dsu {
ll n;
vector<ll> par;
vector<ll> sz;
dsu(ll N) : n(N) {
par.resize(n);
sz.resize(n);
for (int i = 0; i < n; i++) {
par[i] = i;
sz[i] = 1;
}
}
ll find_p(ll x) {
if (x == par[x]) {
return x;
}
ll p = find_p(par[x]);
par[x] = p;
return p;
}
void join(ll x, ll y) {
x = find_p(x);
y = find_p(y);
if (x == y) {
return;
}
if (sz[y] > sz[x]) {
swap(x, y);
}
par[y] = x;
sz[x] += sz[y];
}
};
void dfs(ll x, ll p) {
vis[x] = 1;
for (auto i : G[x]) {
if (i.first != p) {
dfs(i.first, x);
mx[x] = max(mx[x], mx[i.first] + i.second);
}
}
}
void dfsu(ll x, ll p) {
vector< pair<ll, ll> > v;
for (auto i : G[x]) {
if (i.first != p) {
v.push_back({mx[i.first] + i.second, i.first});
}
}
sort(v.rbegin(), v.rend());
for (auto i : G[x]) {
if (i.first != p) {
mxu[i.first] = mxu[x] + i.second;
if (v.size() > 1) {
if (v[0].second != i.first) {
mxu[i.first] = max(mxu[i.first], v[0].first + i.second);
}
else {
mxu[i.first] = max(mxu[i.first], v[1].first + i.second);
}
}
dfsu(i.first, x);
}
}
// cout << x << ' ' << mx[x] << ' ' << mxu[x] << '\n';
}
pair<ll, ll> dfsp(ll x, ll p) {
pair<ll, ll> pr = {max(mx[x], mxu[x]), x};
for (auto i : G[x]) {
if (i.first != p) {
pr = min(pr, dfsp(i.first, x));
}
}
return pr;
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
n = N;
m = M;
l = L;
dsu d(n);
for (int i = 0; i < m; i++) {
G[A[i]].push_back({B[i], T[i]});
G[B[i]].push_back({A[i], T[i]});
d.join(A[i], B[i]);
}
vector< pair<int, int> > vp;
if (n <= 3000) {
vector< pair<ll, ll> > vec(n, {INF, INF});
for (ll i = 0; i < n; i++) {
dfs(i, -1);
vec[d.find_p(i)] = min(vec[d.find_p(i)], make_pair(mx[i], i));
}
for (ll i = 0; i < n; i++) {
if (d.par[i] == i) {
vp.push_back(vec[i]);
}
}
}
else {
for (int i = 0; i < n; i++) {
if (!vis[i]) {
dfs(i, -1);
dfsu(i, -1);
vp.push_back(dfsp(i, -1));
}
}
}
// for (auto i : vp) {
// cout << i.first << ' ' << i.second << '\n';
// }
if (vp.size() + m != n - 1) {
exit(-1);
}
sort(vp.rbegin(), vp.rend());
int ans = vp[0].first;
if (vp.size() > 1) {
ans = max(ans, vp[0].first + vp[1].first + l);
}
if (vp.size() > 2) {
ans = max(ans, vp[1].first + vp[2].first + l * 2);
}
return ans;
}
Compilation message
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:132:23: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'll' {aka 'long long int'} [-Wsign-compare]
132 | if (vp.size() + m != n - 1) {
| ~~~~~~~~~~~~~~^~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
57 ms |
20820 KB |
Execution failed because the return code was nonzero |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
2 ms |
2652 KB |
Execution failed because the return code was nonzero |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
57 ms |
20820 KB |
Execution failed because the return code was nonzero |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
16 ms |
9180 KB |
Execution failed because the return code was nonzero |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
2 ms |
2652 KB |
Execution failed because the return code was nonzero |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
57 ms |
20820 KB |
Execution failed because the return code was nonzero |
| 2 |
Halted |
0 ms |
0 KB |
- |
