#include<bits/stdc++.h>
#define pb push_back
using namespace std;
vector<vector<pair<int, int>>> edge;
double solve (int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
edge.resize(N);
for (int i = 0; i < M; i ++) {
edge[x[i]].pb({y[i], c[i]});
edge[y[i]].pb({x[i], c[i]});
}
priority_queue<pair<int, int>> pq;
pq.push({0, 0});
vector<bool> visited(N, false);
vector<int> dist(N, 1e9);
dist[0] = 0;
while (!pq.empty()) {
int v = pq.top().second; pq.pop();
visited[v] = true;
for (auto [u, w] : edge[v]) {
if (visited[u]) continue;
if (dist[v] + w < dist[u]) {
dist[u] = dist[v] + w;
pq.push({-dist[u], u});
}
}
}
return dist[H];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |