#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<double, pair<int, int>>;
const ll M = 1000000000000000000;
const double epsilon = 0.000001;
double solve(int n, int m, int k, int h, vector<int> x,
vector<int> y, vector<int> c, vector<int> arr) {
double d[n]; d[0] = 0;
for(int l = 1; l < n; l++) d[l] = M;
vector<pair<int, int>> adj[n];
for(int l = 0; l < m; l++) {
adj[x[l]].push_back({y[l], c[l]});
adj[y[l]].push_back({x[l], c[l]});
}
priority_queue<pi, vector<pi>, greater<pi>> pq;
pq.push({0, {k, 0}});
while(!pq.empty()) {
double w = pq.top().first;
int u = pq.top().second.second;
int t = pq.top().second.first; pq.pop();
for(auto v : adj[u]) {
double D = w + v.second;
if(arr[v.first] == 0) D = 0;
if(d[v.first] > D) {
d[v.first] = D;
if(v.first != h) pq.push({d[v.first], {t, v.first}});
}
if(arr[v.first] == 2) {
for(int l = 1; l <= t; l++) {
D /= 2.0;
if(fabs(d[v.first] - D) > epsilon) {
d[v.first] = D;
if(v.first != h) pq.push({d[v.first], {t - l, v.first}});
}
}
}
}
}
if(d[h] == M) return -1;
return d[h];
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
18 ms |
436 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
21 ms |
472 KB |
Correct. |
2 |
Correct |
25 ms |
412 KB |
Correct. |
3 |
Correct |
27 ms |
468 KB |
Correct. |
4 |
Correct |
26 ms |
340 KB |
Correct. |
5 |
Correct |
25 ms |
448 KB |
Correct. |
6 |
Correct |
21 ms |
1292 KB |
Correct. |
7 |
Correct |
28 ms |
1236 KB |
Correct. |
8 |
Correct |
12 ms |
2388 KB |
Correct. |
9 |
Correct |
23 ms |
348 KB |
Correct. |
10 |
Correct |
22 ms |
340 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
28 ms |
416 KB |
Correct. |
2 |
Correct |
27 ms |
428 KB |
Correct. |
3 |
Correct |
25 ms |
440 KB |
Correct. |
4 |
Correct |
26 ms |
340 KB |
Correct. |
5 |
Correct |
27 ms |
468 KB |
Correct. |
6 |
Correct |
5 ms |
1108 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
25 ms |
5704 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
22 ms |
460 KB |
Correct. |
2 |
Correct |
26 ms |
404 KB |
Correct. |
3 |
Correct |
24 ms |
456 KB |
Correct. |
4 |
Correct |
23 ms |
1236 KB |
Correct. |
5 |
Correct |
21 ms |
356 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
30 ms |
424 KB |
Correct. |
2 |
Correct |
22 ms |
416 KB |
Correct. |
3 |
Correct |
41 ms |
7740 KB |
Correct. |
4 |
Correct |
15 ms |
1108 KB |
Correct. |
5 |
Correct |
25 ms |
352 KB |
Correct. |
6 |
Correct |
24 ms |
444 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3047 ms |
263336 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3025 ms |
4624 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |