# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
851874 | stdfloat | Commuter Pass (JOI18_commuter_pass) | C++17 | 406 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;
using ll = long long;
ll ans, mnu, mnv;
int n, m, s, t, u, v;
vector<vector<pair<int, int>>> E;
vector<vector<vector<int>>> V;
vector<ll> dis, diss, dist, disu, disv;
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<>> q;
vector<ll> f(int st){
dis.assign(n + 1, LLONG_MAX);
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;
q.push({dis[i.first], i.first});
}
}
Compilation message (stderr)
# | 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... |