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>
#include "cyberland.h"
using namespace std;
// #define int long long
#define ff first
#define ss second
const int shrek = 1e5;
vector< vector<pair<int, int>>> adj(shrek);
double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
vector<int> dist (n);
for(int i = 0; i < n; i++) dist[i] = -1;
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]});
}
priority_queue <pair<int, int>> q;
q.push({0, 0});
while(!q.empty()) {
pair<int, int> p = q.top();
q.pop();
if(dist[p.ss] != -1) continue;
dist[p.ss] = -p.ff;
for(auto x : adj[p.ss]) {
q.push({p.ff - x.ss, x.ff});
}
}
double ans = dist[h];
return ans;
}
# | 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... |