#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
vector<pair<int, double>> adj[N];
for (int i = 0; i < M; i++) {
adj[x[i]].push_back({y[i], (double)c[i]});
adj[y[i]].push_back({x[i], (double)c[i]});
}
bool useful[N] = {};
queue<int> qu;
qu.push(0);
useful[0] = true;
while (qu.size()) {
int f = qu.front();
qu.pop();
if (f == H) continue;
for (auto [nf, _] : adj[f]) {
if (!useful[nf]) {
useful[nf] = true;
qu.push(nf);
}
}
}
vector<vector<double>> dst(min(K, 80)+1, vector<double>(N, 1e14));
double ans = 1e14;
for (int ii = 0; ii <= min(K, 80); ii++) {
priority_queue<pair<double, int>> pq;
for (int i = 0; i < N && ii; i++) {
if (!useful[i]) continue;
if (arr[i] == 2) {
for (auto [j, v] : adj[i]) {
if (!useful[j] || j == H) continue;
dst[ii][i] = min(dst[ii][i], (dst[ii-1][j] + v) / 2.0);
}
pq.push({dst[ii][i], i});
} else if (!arr[i]) {
dst[ii][i] = 0;
pq.push({0, i});
}
}
if (!ii) {
dst[0][0] = 0;
pq.push({0, 0});
}
while (pq.size()) {
auto [d, f] = pq.top();
pq.pop();
if (f == H) continue;
for (auto [nf, v] : adj[f]) {
if (d + v < dst[ii][nf] && useful[nf] && arr[nf] == 1) {
dst[ii][nf] = d + v;
pq.push({d+v, nf});
}
}
}
ans = min(ans, dst[ii][H]);
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
35 ms |
468 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
24 ms |
736 KB |
Correct. |
2 |
Correct |
28 ms |
688 KB |
Correct. |
3 |
Correct |
27 ms |
680 KB |
Correct. |
4 |
Correct |
30 ms |
704 KB |
Correct. |
5 |
Correct |
28 ms |
732 KB |
Correct. |
6 |
Correct |
26 ms |
3716 KB |
Correct. |
7 |
Correct |
31 ms |
3684 KB |
Correct. |
8 |
Correct |
14 ms |
7380 KB |
Correct. |
9 |
Correct |
27 ms |
500 KB |
Correct. |
10 |
Correct |
28 ms |
488 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
222 ms |
716 KB |
Correct. |
2 |
Correct |
203 ms |
692 KB |
Correct. |
3 |
Correct |
178 ms |
780 KB |
Correct. |
4 |
Correct |
117 ms |
448 KB |
Correct. |
5 |
Correct |
112 ms |
476 KB |
Correct. |
6 |
Correct |
48 ms |
3156 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
104 ms |
20808 KB |
Correct. |
2 |
Correct |
117 ms |
672 KB |
Correct. |
3 |
Correct |
99 ms |
744 KB |
Correct. |
4 |
Correct |
97 ms |
656 KB |
Correct. |
5 |
Correct |
67 ms |
468 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
99 ms |
692 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
218 ms |
684 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
164 ms |
684 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
376 ms |
1044 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |