#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], c[i]});
adj[y[i]].push_back({x[i], 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]) continue;
dst[ii][i] = min(dst[ii][i], (dst[ii-1][j] + v) / 2.0);
}
} 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 (d > dst[ii][f]) continue;
for (auto [nf, v] : adj[f]) {
if (d + v < dst[ii][nf] && useful[nf]) {
dst[ii][nf] = d + v;
pq.push({d+v, nf});
}
}
}
ans = min(ans, dst[ii][H]);
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
32 ms |
420 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
27 ms |
860 KB |
Correct. |
2 |
Correct |
30 ms |
676 KB |
Correct. |
3 |
Correct |
29 ms |
672 KB |
Correct. |
4 |
Correct |
29 ms |
692 KB |
Correct. |
5 |
Correct |
28 ms |
684 KB |
Correct. |
6 |
Correct |
26 ms |
3728 KB |
Correct. |
7 |
Correct |
32 ms |
3684 KB |
Correct. |
8 |
Correct |
16 ms |
7380 KB |
Correct. |
9 |
Correct |
28 ms |
496 KB |
Correct. |
10 |
Correct |
27 ms |
492 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
223 ms |
700 KB |
Correct. |
2 |
Correct |
208 ms |
672 KB |
Correct. |
3 |
Correct |
189 ms |
704 KB |
Correct. |
4 |
Correct |
124 ms |
588 KB |
Correct. |
5 |
Correct |
128 ms |
480 KB |
Correct. |
6 |
Correct |
50 ms |
3156 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
65 ms |
20816 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
101 ms |
684 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
326 ms |
728 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
213 ms |
688 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
329 ms |
1112 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |