#include <bits/stdc++.h>
using namespace std;
#include "cyberland.h"
typedef long double ld;
typedef long long ll;
#define fi first
#define se second
#define pi pair<int, int>
#define pii pair<int, pi>
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
vector <pi> adj[100000];
double dist[75][100000];
double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
K = min(K, 70);
priority_queue <pair<double, int>, vector<pair<double, int> >, greater<pair<double, int> > > pq;
for(int i=0;i<N;i++)for(int j=0;j<=K;j++)dist[j][i] = 1e18;
dist[0][0] = 0;
for(int i=0;i<N;i++)adj[i].clear();
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]});
}
for(int i = 0; i <= K; i++){
for(int j = 0; j < N; j++){
if(dist[i][j] != 1e18)pq.push({dist[i][j], j});
}
while(!pq.empty()){
double a = pq.top().fi; int b = pq.top().se;
pq.pop();
if(dist[i][b] < a || b == H)continue;
for(auto [ii, j] : adj[b]){
if(arr[ii] == 0){
if(dist[i][ii])dist[i][ii] = 0, pq.push({0, ii});
}
else if(dist[i][ii] > a + j)dist[i][ii] = a + j, pq.push({dist[i][ii], ii});
if(arr[i] == 2 && i < K){
if(dist[i+1][ii] > (a + ((double)j)) / 2)dist[i+1][ii] = (a + ((double)j)) / 2;
}
}
}
}
double ans = 1e18;
for(int i=0;i<=K;i++)ans = min(ans, dist[i][H]);
if(ans > 1e15)return -1;
else return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
19 ms |
2900 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
22 ms |
3232 KB |
Correct. |
2 |
Correct |
27 ms |
3180 KB |
Correct. |
3 |
Correct |
25 ms |
3204 KB |
Correct. |
4 |
Correct |
27 ms |
3216 KB |
Correct. |
5 |
Correct |
26 ms |
3216 KB |
Correct. |
6 |
Correct |
26 ms |
5888 KB |
Correct. |
7 |
Correct |
30 ms |
5812 KB |
Correct. |
8 |
Correct |
18 ms |
8940 KB |
Correct. |
9 |
Correct |
25 ms |
2916 KB |
Correct. |
10 |
Correct |
24 ms |
2900 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
29 ms |
3156 KB |
Correct. |
2 |
Correct |
30 ms |
3200 KB |
Correct. |
3 |
Correct |
28 ms |
3236 KB |
Correct. |
4 |
Correct |
28 ms |
2904 KB |
Correct. |
5 |
Correct |
27 ms |
2900 KB |
Correct. |
6 |
Correct |
8 ms |
5332 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
41 ms |
20464 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
28 ms |
3256 KB |
Correct. |
2 |
Correct |
31 ms |
3156 KB |
Correct. |
3 |
Correct |
29 ms |
3156 KB |
Correct. |
4 |
Correct |
25 ms |
5960 KB |
Correct. |
5 |
Correct |
21 ms |
2900 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
27 ms |
3264 KB |
Correct. |
2 |
Correct |
22 ms |
3192 KB |
Correct. |
3 |
Correct |
55 ms |
26224 KB |
Correct. |
4 |
Correct |
19 ms |
5180 KB |
Correct. |
5 |
Correct |
26 ms |
2916 KB |
Correct. |
6 |
Correct |
24 ms |
3216 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
24 ms |
3240 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
28 ms |
3668 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |