#include <bits/stdc++.h>
#include "cyberland.h"
using namespace std;
const int MAX_N = 1e5 + 5;
const int MAX_K = 71;
const long long INF = 1e18 + 7;
vector <pair <int, int>> graph[MAX_N];
double power[MAX_K], dist[MAX_N][MAX_K];
bool visited[MAX_N];
double solve(int N, int M, int K, int H, vector <int> x, vector <int> y, vector <int> c, vector <int> arr) {
K = min(K, 66);
power[0] = 1.0;
for (int i = 1; i <= K; i++) power[i] = power[i - 1] / 2.0;
arr[0] = 0;
for (int i = 0; i < N; i++) {
graph[i].clear();
visited[i] = false;
for (int k = 0; k <= K; k++) {
dist[i][k] = INF;
}
}
for (int i = 0; i < M; i++) {
graph[x[i]].emplace_back(y[i], c[i]);
graph[y[i]].emplace_back(x[i], c[i]);
}
queue <int> q;
q.push(0);
visited[0] = true;
while (!q.empty()) {
int u = q.front();
q.pop();
for (auto [v, c] : graph[u]) {
if (visited[v] == true or v == H) continue;
visited[v] = true;
q.push(v);
}
}
priority_queue <tuple <double, int, int>> pq;
pq.emplace(0, 0, H);
dist[H][0] = 0;
while (!pq.empty()) {
auto [d, k, u] = pq.top();
pq.pop();
if (dist[u][k] < -d) continue;
if (arr[u] == 0) return -d;
for (auto [v, c] : graph[u]) {
if (visited[v] == false) continue;
if (dist[u][k] + c * power[k] < dist[v][k]) {
dist[v][k] = dist[u][k] + c * power[k];
pq.emplace(-dist[v][k], k, v);
}
if (arr[v] == 2 and k < K and dist[u][k] + c * power[k + 1] < dist[v][k + 1]) {
dist[v][k + 1] = dist[u][k] + c * power[k + 1];
pq.emplace(-dist[v][k + 1], k + 1, v);
}
}
}
return -1;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
20 ms |
2772 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
20 ms |
3516 KB |
Correct. |
2 |
Correct |
23 ms |
3304 KB |
Correct. |
3 |
Correct |
21 ms |
3332 KB |
Correct. |
4 |
Correct |
23 ms |
3284 KB |
Correct. |
5 |
Correct |
22 ms |
3336 KB |
Correct. |
6 |
Correct |
20 ms |
8788 KB |
Correct. |
7 |
Correct |
27 ms |
8588 KB |
Correct. |
8 |
Correct |
15 ms |
14804 KB |
Correct. |
9 |
Correct |
22 ms |
2772 KB |
Correct. |
10 |
Correct |
22 ms |
2780 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
22 ms |
3412 KB |
Correct. |
2 |
Correct |
22 ms |
3324 KB |
Correct. |
3 |
Correct |
25 ms |
3468 KB |
Correct. |
4 |
Correct |
21 ms |
2772 KB |
Correct. |
5 |
Correct |
21 ms |
2772 KB |
Correct. |
6 |
Correct |
7 ms |
7656 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
39 ms |
38736 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
21 ms |
3400 KB |
Correct. |
2 |
Correct |
26 ms |
3412 KB |
Correct. |
3 |
Correct |
29 ms |
3368 KB |
Correct. |
4 |
Correct |
28 ms |
8788 KB |
Correct. |
5 |
Correct |
21 ms |
2772 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
21 ms |
3392 KB |
Correct. |
2 |
Correct |
19 ms |
3416 KB |
Correct. |
3 |
Correct |
57 ms |
49868 KB |
Correct. |
4 |
Correct |
18 ms |
7124 KB |
Correct. |
5 |
Correct |
27 ms |
2768 KB |
Correct. |
6 |
Correct |
21 ms |
3388 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
21 ms |
3352 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
23 ms |
3424 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |