이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
double solve(int n, int m, int k, int h, vector<int> x,
vector<int> y, vector<int> c, vector<int> arr) {
double d[n]; d[0] = 0;
for(int l = 1; l < n; l++) d[l] = INT_MAX;
vector<pair<int, int>> adj[n];
for(int l = 0; l < m; l++) {
adj[x[l]].push_back({y[l], c[l]});
adj[y[l]].push_back({x[l], c[l]});
}
priority_queue<pair<double, int>,
vector<pair<double, int>>, greater<pair<double, int>>> pq;
pq.push({0, 0});
while(!pq.empty()) {
double w = pq.top().first;
int u = pq.top().second; pq.pop();
for(auto v : adj[u]) {
if(d[v.first] > w + v.second) {
d[v.first] = w + v.second;
if(arr[v.first] == 0) d[v.first] = 0;
if(v.first != h) pq.push({d[v.first], v.first});
}
}
}
if(d[h] == INT_MAX) return -1;
return d[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... |