#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pdi pair<double,pii>
#define fi first
#define se second
double solve(int N, int M, int K, int T, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
K=min(K,100);
vector<vector<double>> dist(N,vector<double>(K+1,1e14));
vector<vector<pii>> edge(N);
for(int i=0;i<M;i++){
edge[x[i]].push_back({y[i],c[i]});
edge[y[i]].push_back({x[i],c[i]});
}
priority_queue<pdi,vector<pdi>,greater<pdi>> pq;
dist[0][0]=0;pq.push({0,{0,0}});
while(!pq.empty()){
auto [d,x]=pq.top();pq.pop();
int u=x.fi,k=x.se;
if(u==T) return d;
for(auto [v,w]:edge[u]){
double nd0=dist[u][k]+w;
double nd1=(dist[u][k]+w)*(arr[v]?1.0/arr[v]:0);
if(k<K && dist[v][k+1]>nd1){
dist[v][k+1]=nd1;
pq.push({nd1,{v,k+1}});
}
if(dist[v][k]>nd0){
dist[v][k]=nd0;
pq.push({nd0,{v,k}});
}
}
}
return -1;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
21 ms |
460 KB |
Correct. |
2 |
Correct |
22 ms |
416 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
96 ms |
856 KB |
Correct. |
2 |
Correct |
151 ms |
896 KB |
Correct. |
3 |
Correct |
138 ms |
900 KB |
Correct. |
4 |
Correct |
149 ms |
892 KB |
Correct. |
5 |
Correct |
146 ms |
900 KB |
Correct. |
6 |
Correct |
85 ms |
4200 KB |
Correct. |
7 |
Correct |
195 ms |
4244 KB |
Correct. |
8 |
Correct |
126 ms |
9544 KB |
Correct. |
9 |
Correct |
101 ms |
440 KB |
Correct. |
10 |
Correct |
98 ms |
436 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
226 ms |
864 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1046 ms |
21284 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
99 ms |
884 KB |
Correct. |
2 |
Correct |
113 ms |
856 KB |
Correct. |
3 |
Correct |
113 ms |
880 KB |
Correct. |
4 |
Correct |
108 ms |
4432 KB |
Correct. |
5 |
Correct |
69 ms |
440 KB |
Correct. |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
153 ms |
1064 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
297 ms |
1320 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1051 ms |
4184 KB |
Wrong Answer. |
2 |
Halted |
0 ms |
0 KB |
- |