# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
917796 | XXBabaProBerkay | 사이버랜드 (APIO23_cyberland) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
using ll = long long;
double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr)
{
vector<vector<pair<int, ll>>> adj(N);
for (int i = 0; i < M; i++)
{
adj[x[i]].emplace_back(y[i], c[i]);
adj[y[i]].emplace_back(x[i], c[i]);
}
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> PQ;
vector<ll> dist(N, 1e18);
dist[0] = 0.0;
PQ.emplace(0.0, 0);
while (!PQ.empty())
{
auto [d, u] = PQ.top();
PQ.pop();
if (d != dist[u])
continue;
if (arr[u] == 0)
dist[u] = 0;
for (pair<int, ll> i : adj[u])
{
auto [v, w] = i;
if (dist[v] > dist[u] + w)
PQ.emplace(dist[v] = dist[u] + w, v);
}
}
return dist[H] == 1e18 ? -1.0 : double(dist[H]);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int N, M, K, H;
cin >> N >> M >> K >> H;
vector<int> x(M), y(M), c(M), arr(N);
for (int i = 0; i < N; i++)
cin >> arr[i];
for (int i = 0; i < M; i++)
cin >> x[i] >> y[i] >> c[i];
cout << solve(N, M, K, H, x, y, c, arr) << '\n';
}