# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
654304 | lunchbox1 | Commuter Pass (JOI18_commuter_pass) | C++17 | 534 ms | 22648 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.
/*
Commuter Pass
https://oj.uz/problem/view/JOI18_commuter_pass
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
template<class T>
using min_pq = priority_queue<T, vector<T>, greater<T>>;
const int N = 1e5;
const LL INF = 1e18;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, m; cin >> n >> m;
int s, t, u, v; cin >> s >> t >> u >> v, s--, t--, u--, v--;
static vector<pair<int, int>> g[N];
while (m--) {
int i, j, c; cin >> i >> j >> c, i--, j--;
g[i].push_back({j, c}), g[j].push_back({i, c});
}
auto gen = [&](int s, LL *dt) {
min_pq<pair<LL, int>> q;
fill(dt, dt + n, INF);
q.push({dt[s] = 0, s});
while (!q.empty()) {
auto [d, i] = q.top(); q.pop();
# | 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... |