#include <bits/stdc++.h>
#include "cyberland.h"
using namespace std;
const int MAX_N = 1e5 + 5;
const int MAX_K = 35;
const long long INF = 1e18 + 7;
vector <pair <int, int>> graph[MAX_N];
double dist[MAX_N][MAX_K];
bool visited[MAX_N][MAX_K];
double solve(int N, int M, int K, int H, vector <int> x, vector <int> y, vector <int> c, vector <int> arr) {
for (int i = 0; i < N; i++) {
graph[i].clear();
for (int k = 0; k <= K; k++) {
dist[i][k] = INF;
visited[i][k] = false;
}
}
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][0] = true;
while (!q.empty()) {
int u = q.front();
q.pop();
for (auto [v, c] : graph[u]) {
if (visited[v][0] == true or v == H) continue;
visited[v][0] = true;
q.push(v);
}
}
priority_queue <tuple <double, int, int>> pq;
arr[0] = 0;
for (int i = 0; i < N; i++) {
if (visited[i][0] == false) continue;
visited[i][0] = false;
if (arr[i] == 0) {
pq.emplace(0, 0, i);
dist[i][0] = 0;
}
}
while (!pq.empty()) {
auto [d, k, u] = pq.top();
pq.pop();
if (visited[u][k] == true) continue;
visited[u][k] = true;
for (auto [v, c] : graph[u]) {
if (v == H) continue;
if (visited[v][k] == false and dist[u][k] + c < dist[v][k]) {
dist[v][k] = dist[u][k] + c;
pq.emplace(-dist[v][k], k, v);
}
if (arr[v] == 2 and k < K and visited[v][k + 1] == false and (dist[u][k] + c) / 2 < dist[v][k + 1]) {
dist[v][k + 1] = (dist[u][k] + c) / 2;
pq.emplace(-dist[v][k + 1], k + 1, v);
}
}
}
double res = INF;
for (int k = 0; k <= K; k++) {
for (auto [v, c] : graph[H]) {
res = min(res, dist[v][k] + c);
}
}
if (res == INF) res = -1;
return res;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
2816 KB |
Correct. |
2 |
Correct |
20 ms |
2768 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
21 ms |
3136 KB |
Correct. |
2 |
Correct |
26 ms |
3104 KB |
Correct. |
3 |
Correct |
24 ms |
3072 KB |
Correct. |
4 |
Correct |
25 ms |
3028 KB |
Correct. |
5 |
Correct |
26 ms |
3088 KB |
Correct. |
6 |
Correct |
24 ms |
6408 KB |
Correct. |
7 |
Correct |
30 ms |
6276 KB |
Correct. |
8 |
Correct |
17 ms |
10068 KB |
Correct. |
9 |
Correct |
24 ms |
2748 KB |
Correct. |
10 |
Correct |
24 ms |
2772 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
27 ms |
3096 KB |
Correct. |
2 |
Correct |
26 ms |
3112 KB |
Correct. |
3 |
Correct |
25 ms |
3060 KB |
Correct. |
4 |
Correct |
26 ms |
2760 KB |
Correct. |
5 |
Correct |
25 ms |
2772 KB |
Correct. |
6 |
Correct |
8 ms |
5716 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
121 ms |
26424 KB |
Correct. |
2 |
Incorrect |
136 ms |
3308 KB |
Wrong Answer. |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
21 ms |
3156 KB |
Correct. |
2 |
Correct |
25 ms |
3156 KB |
Correct. |
3 |
Correct |
25 ms |
3128 KB |
Correct. |
4 |
Correct |
25 ms |
6484 KB |
Correct. |
5 |
Correct |
22 ms |
2644 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
28 ms |
3112 KB |
Correct. |
2 |
Correct |
20 ms |
3112 KB |
Correct. |
3 |
Correct |
49 ms |
31024 KB |
Correct. |
4 |
Correct |
19 ms |
5504 KB |
Correct. |
5 |
Correct |
23 ms |
2764 KB |
Correct. |
6 |
Correct |
24 ms |
3140 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
161 ms |
3584 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3078 ms |
12176 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |