# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155842 | TAISA_ | Dreaming (IOI13_dreaming) | C++14 | 57 ms | 9584 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>
#define all(vec) vec.begin(), vec.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = (1 << 30) - 1;
const ll LINF = (1LL << 60) - 1LL;
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
if (M == N - 1) {
return 0;
}
vector<vector<P>> G(N);
vector<int> vis(N);
for (int i = 0; i < M; i++) {
G[A[i]].push_back(P(B[i], T[i]));
G[B[i]].push_back(P(A[i], T[i]));
}
vector<ll> s;
for (int i = 0; i < N; i++) {
if (!vis[i] && G[i].size() == 1) {
vis[i] = 1;
vector<ll> v;
int t = G[i][0].first, p = i;
v.push_back(G[i][0].second);
while (G[t].size() > 1) {
vis[t] = 1;
if (G[t][0].first == p) {
v.push_back(G[t][1].second);
t = G[t][1].first;
} else {
v.push_back(G[t][0].second);
t = G[t][1].first;
}
}
vis[t] = 1;
vector<ll> sum(v.size() + 1);
for (int j = 0; j < v.size(); j++) {
sum[j + 1] = sum[j] + v[j];
}
ll mi = LINF;
for (int j = 0; j <= v.size(); j++) {
mi = min(mi, max(sum[j], sum[v.size()] - sum[j]));
}
s.push_back(mi);
}
}
sort(all(s));
reverse(all(s));
ll ans = 0;
ans = max(ans, s[0] + s[1] + L);
if (s.size() > 2) {
ans = max(ans, s[1] + s[2] + 2LL * L);
}
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... |