| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 383672 | aarr | 꿈 (IOI13_dreaming) | C++14 | 56 ms | 12396 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>
using namespace std;
const int N = 100 * 1000 + 5;
const int inf = 2000 * 1073 * 1000;
int d1[N], d2[N], d3[N];
vector <int> cmp, vec;
vector <pair <int, int> > adj[N];
//bool mark[N];
void dfs(int v, int* dis) {
cmp.push_back(v);
for (auto p : adj[v]) {
int u = p.first, w = p.second;
if (dis[u] == inf) {
int u = p.first, w = p.second;
dis[u] = dis[v] + w;
dfs(u, dis);
}
}
}
int f(int v, int* dis) {
cmp.clear();
dis[v] = 0;
dfs(v, dis);
int maxi = v;
for (auto x : cmp) {
if (dis[x] > dis[maxi]) {
maxi = x;
}
}
return maxi;
}
int travelTime(int n, int m, int l, int A[], int B[], int T[]) {
for (int i = 0; i <= n; i++) {
d1[i] = d2[i] = d3[i] = inf;
}
for (int i = 0; i < m; i++) {
int u = A[i], v = B[i], w = T[i];
adj[u].push_back({v, w});
adj[v].push_back({u, w});
}
for (int i = 0; i < n; i++) {
if (d1[i] == inf) {
int u = f(i, d1);
int v = f(u, d2);
f(v, d3);
if (cmp.size() == n) {
return d2[v];
}
int mini = i, mnv = max(d2[i], d3[i]);
for (auto x : cmp) {
if (max(d2[x], d3[x]) < mnv) {
mnv = max(d2[x], d3[x]);
mini = x;
}
}
vec.push_back(mnv);
// cout << "73 " << mini << " " << mnv << endl;
}
}
sort(vec.begin(), vec.end());
int k = vec.size();
int ans = vec[k - 1] + vec[k - 2] + l;
if (k > 2) {
ans = max(ans, vec[k - 2] + vec[k - 3] + l * 2);
}
return ans;
}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... | ||||
