# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
414873 | snasibov05 | Dreaming (IOI13_dreaming) | C++14 | 1094 ms | 9288 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 <vector>
using namespace std;
#define pb push_back
#define pii pair<int, int>
#define oo 1000000000
vector<vector<pii>> ed;
vector<bool> visited;
vector<int> mx;
vector<int> cur;
void dfs(int v){
cur.pb(v);
visited[v] = true;
for (auto [x, t] : ed[v]){
if (!visited[x]) dfs(x);
}
}
int mxdist(int v, int pr){
int res = 0;
for (auto [x, t] : ed[v]){
if (x != pr){
res = max(res, mxdist(x, v) + t);
}
}
return res;
}
void findmn(int v){
cur.clear();
dfs(v);
int mn = oo;
for (auto x : cur){
int k = mxdist(x, -1);
mn = min(mn, k);
}
mx.pb(mn);
}
int travelTime(int n, int m, int l, int a[], int b[], int t[]) {
ed.resize(n);
visited.resize(n);
for (int i = 0; i < m; ++i) {
ed[a[i]].pb({b[i], t[i]});
ed[b[i]].pb({a[i], t[i]});
}
for (int i = 0; i < n; ++i) {
if (!visited[i]) findmn(i);
}
int Max = 0, Maxi = 0;
for (int i = 0; i < mx.size(); ++i) {
if (mx[i] > Max){
Max = mx[i];
Maxi = i;
}
}
int SMax = 0;
for (int i = 0; i < mx.size(); ++i){
if (mx[i] > SMax && i != Maxi) SMax = mx[i];
}
return Max + SMax + 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... |