# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
605314 | jjiangly | Commuter Pass (JOI18_commuter_pass) | C++14 | 2064 ms | 24412 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 all(x) x.begin(), x.end()
#define siz(x) int(x.size())
#define ll long long
#define ar array
#define vt vector
#define inf int(1e9)
#define lnf (long long) 1e15
const int nxm = int(1e5) + 7;
int n, m, s, t, u, v;
namespace sub1 {
vt<vt<ar<int, 2>>> e(nxm);
vt<vt<ll>> d(3, vt<ll> (nxm, lnf));
void exe() {
for (int i = 0; i < m; ++i) {
int a, b, c;
cin >> a >> b >> c;
--a, --b;
e[a].push_back({c, b});
e[b].push_back({c, a});
}
function<void(int, int)> dijkstra = [&](int root, int id) {
priority_queue<ar<ll, 2>, vt<ar<ll, 2>>, greater<ar<ll, 2>>> que;
que.push({0, root});
d[id][root] = 0;
while (que.size()) {
# | 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... |