| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 752977 | MohamedFaresNebili | Cyberland (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;
using ll = long long;
const ll M = 1000000000000000000;
double solve(int n, int m, int k, int h, vector<int> x,
vector<int> y, vector<int> c, vector<int> arr) {
long double d[n]; d[0] = 0;
for(int l = 1; l < n; l++) d[l] = M;
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<long double, int>>, greater<pair<long 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]) {
double D = w + v.second;
if(arr[v.first] == 0) D = 0;
if(arr[v.first] == 2) D /= 2.0;
if(d[v.first] > D) {
d[v.first] = D;
if(v.first != h) pq.push({d[v.first], v.first});
}
}
}
if(d[h] == M) return -1;
return d[h];
}