# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155842 | 2019-10-01T04:06:39 Z | TAISA_ | Dreaming (IOI13_dreaming) | C++14 | 57 ms | 9584 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 57 ms | 9584 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 57 ms | 9584 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 57 ms | 9584 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 29 ms | 6016 KB | Output is correct |
2 | Correct | 30 ms | 6136 KB | Output is correct |
3 | Correct | 30 ms | 6008 KB | Output is correct |
4 | Correct | 37 ms | 6140 KB | Output is correct |
5 | Correct | 35 ms | 6008 KB | Output is correct |
6 | Correct | 43 ms | 6648 KB | Output is correct |
7 | Correct | 31 ms | 6264 KB | Output is correct |
8 | Correct | 29 ms | 5884 KB | Output is correct |
9 | Correct | 29 ms | 5880 KB | Output is correct |
10 | Correct | 30 ms | 6264 KB | Output is correct |
11 | Correct | 2 ms | 376 KB | Output is correct |
12 | Correct | 5 ms | 3192 KB | Output is correct |
13 | Correct | 6 ms | 3192 KB | Output is correct |
14 | Correct | 6 ms | 3064 KB | Output is correct |
15 | Correct | 6 ms | 3192 KB | Output is correct |
16 | Correct | 5 ms | 3064 KB | Output is correct |
17 | Correct | 5 ms | 3064 KB | Output is correct |
18 | Correct | 5 ms | 3192 KB | Output is correct |
19 | Correct | 5 ms | 3064 KB | Output is correct |
20 | Correct | 2 ms | 376 KB | Output is correct |
21 | Runtime error | 3 ms | 504 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
22 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 57 ms | 9584 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 57 ms | 9584 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |