#include "cyberland.h"
#include<bits/stdc++.h>
using namespace std;
#define vec vector
#define int long long
#define float double
const int INF = 1e17;
double solve(int32_t N, int32_t M, int32_t K, int32_t H, std::vector<int32_t> x, std::vector<int32_t> y, std::vector<int32_t> c, std::vector<int32_t> t) {
float ans = INF;
int n = N;
int m = M;
int k = K;
priority_queue<pair<pair<int, float>, int>, vector<pair<pair<int, float>, int>>, greater<pair<pair<int, float>, int>>> pq;
vec<vec<bool>> vis(k+1, vec<bool>(n, false));
vec<vec<pair<int, int>>> g(n);
for(int i = 0; i<m; i++) {
g[x[i]].push_back({y[i], c[i]});
g[y[i]].push_back({x[i], c[i]});
}
pq.push({{0, 0}, 0});
vec<bool> dfs_vis(n, false);
vec<int> stk{0};
dfs_vis[0] = true;
while(stk.size() > 0) {
int u = stk.back();
stk.pop_back();
if(u==H) continue;
if(t[u] == 0) {
pq.push({{0, 0}, u});
}
for(auto e : g[u]) {
if(dfs_vis[e.first]) continue;
stk.push_back(e.first);
dfs_vis[e.first] = true;
}
}
while(pq.size() > 0) {
pair<pair<int, float>, int> cur = pq.top();
pq.pop();
int ck = cur.first.first;
float d = cur.first.second;
int u = cur.second;
if(ck > k) break;
if(u == H) {
ans = min(ans, d);
continue;
}
if(vis[ck][u]) {
continue;
}
vis[ck][u] = true;
for(auto e : g[u]) {
int v = e.first;
float w = e.second;
if(vis[ck][v]) continue;
pq.push({{ck, d+w}, v});
}
if(t[u] == 2) {
pq.push({{ck+1, d/2}, u});
}
}
if(ans == INF) return -1;
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
29 ms |
860 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
1368 KB |
Correct. |
2 |
Correct |
22 ms |
1628 KB |
Correct. |
3 |
Correct |
19 ms |
1484 KB |
Correct. |
4 |
Correct |
24 ms |
1616 KB |
Correct. |
5 |
Correct |
23 ms |
1628 KB |
Correct. |
6 |
Correct |
17 ms |
2444 KB |
Correct. |
7 |
Correct |
22 ms |
2524 KB |
Correct. |
8 |
Correct |
10 ms |
3164 KB |
Correct. |
9 |
Correct |
22 ms |
1372 KB |
Correct. |
10 |
Correct |
24 ms |
1384 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
32 ms |
1372 KB |
Correct. |
2 |
Correct |
24 ms |
1368 KB |
Correct. |
3 |
Correct |
22 ms |
1368 KB |
Correct. |
4 |
Correct |
26 ms |
1272 KB |
Correct. |
5 |
Correct |
26 ms |
1276 KB |
Correct. |
6 |
Correct |
5 ms |
1628 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
116 ms |
8012 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
1360 KB |
Correct. |
2 |
Correct |
27 ms |
1628 KB |
Correct. |
3 |
Correct |
21 ms |
1624 KB |
Correct. |
4 |
Correct |
21 ms |
2464 KB |
Correct. |
5 |
Correct |
23 ms |
1112 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
1280 KB |
Correct. |
2 |
Correct |
19 ms |
1492 KB |
Correct. |
3 |
Correct |
33 ms |
10936 KB |
Correct. |
4 |
Correct |
14 ms |
2232 KB |
Correct. |
5 |
Correct |
28 ms |
1372 KB |
Correct. |
6 |
Correct |
21 ms |
1624 KB |
Correct. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
192 ms |
1424 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3079 ms |
102648 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |