# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1081302 | asdasdqwer | Dreaming (IOI13_dreaming) | C++14 | 41 ms | 24320 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 <bits/stdc++.h>
using namespace std;
#include "dreaming.h"
#define pii array<int,2>
#define ll long long
vector<vector<pii>> g;
vector<bool> vis;
vector<int> dis1, dis2, dis3;
pii dfs(int node, int p, vector<int> &dis) {
vis[node]=true;
pii ret = {dis[node], node};
for (auto [ne, we] : g[node]) {
if (ne == p) continue;
dis[ne] = dis[node] + we;
ret = max(ret, dfs(ne, node, dis));
}
return ret;
}
int get_diam(int node, int p, vector<int> &d1, vector<int> &d2) {
int ret = max(d1[node], d2[node]);
for (auto [ne, we] : g[node]) {
if (ne == p) continue;
ret = min(ret, get_diam(ne, node, d1, d2));
}
return ret;
}
int diameter(int node) {
dis1[node]=0;
dfs(node, -1, dis1);
auto [n1, d1] = dfs(node, -1, dis1);
auto [n2, d2] = dfs(n1, -1, dis2);
auto [n3, d3] = dfs(n2, -1, dis2);
return get_diam(node, -1, dis2, dis3);
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
g.resize(N);
dis1.resize(N);
dis2.resize(N);
dis3.resize(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]});
}
vis.assign(N, false);
vector<int> dia;
for (int i=0;i<N;i++) {
if (vis[i]) continue;
dia.push_back(diameter(i));
}
sort(dia.begin(), dia.end(), greater<int>());
return dia[0] + dia[1] + L;
}
Compilation message (stderr)
# | 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... |