# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
851881 | stdfloat | Commuter Pass (JOI18_commuter_pass) | C++17 | 1726 ms | 262144 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 int long long
int32_t main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int n, m, s, t, u, v;
cin >> n >> m >> s >> t >> u >> v;
vector<pair<int, int>> E[n + 1];
while (m--) {
int a, b, c;
cin >> a >> b >> c;
E[a].push_back({b, c});
E[b].push_back({a, c});
}
auto f = [&](int st) -> vector<int>{
vector<int> dis(n + 1, LLONG_MAX);
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> q;
dis[st] = 0;
q.push({0, st});
while (!q.empty()) {
int x = q.top().second;
q.pop();
for (auto i : E[x]) {
if (dis[x] + i.second < dis[i.first]) {
dis[i.first] = dis[x] + i.second;
# | 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... |