#include "cyberland.h"
#include <vector>
#include <queue>
#include <iostream>
using namespace std;
typedef long long ll;
typedef long double ld;
const ld INF = 1e18;
struct T {
ld dist;
int k;
int node;
bool operator>(const T &other) const {
if (dist != other.dist) return dist > other.dist;
if (k != other.k) return k > other.k;
return node > other.node;
}
};
ld divByPow2(int x, int k) {
if (k > 30) return (ld)0;
return (ld)(x / (1LL << k));
}
void checkReal(int start, int H, vector<vector<pair<int, int>>> &adj, vector<bool> &real) {
real[start] = true;
for (const pair<int, int> &i : adj[start]) {
if (i.first == H) real[H] = true;
if (i.first != H && !real[i.first]) {
checkReal(i.first, H, adj, real);
}
}
}
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) {
vector<vector<pair<int, int>>> adj(N);
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]});
}
// find "real" nodes
vector<bool> real(N, false);
checkReal(0, H, adj, real);
if (!real[H]) return -1;
// start djikstra's from H
vector<vector<ld>> dist(N, vector<ld>(K + 1, INF));
// vector<ld> dist(N, INF);
dist[H][0] = 0;
priority_queue<T, vector<T>, greater<T>> pq;
pq.push({0, 0, H});
while (!pq.empty()) {
const auto [cdist, k, node] = pq.top();
pq.pop();
if ((arr[node] == 0 || node == 0) && real[node]) {
return cdist;
}
if (cdist != dist[node][k]) continue;
for (const pair<int, int> &i : adj[node]) {
if (cdist + divByPow2(i.second, k) < dist[i.first][k]) {
dist[i.first][k] = cdist + divByPow2(i.second, k);
pq.push({dist[i.first][k], k, i.first});
}
// power-up 2
if (arr[i.first] == 2 && cdist + divByPow2(i.second, k + 1) < dist[i.first][k+1] && k < K) {
dist[i.first][k+1] = cdist + divByPow2(i.second, k + 1);
pq.push({dist[i.first][k+1], k + 1, i.first});
}
}
}
return -1;
}
