# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
307525 | shivensinha4 | Commuter Pass (JOI18_commuter_pass) | C++17 | 1 ms | 384 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 for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
#define endl '\n'
const int MXN = 10;
const ll INF = 1e15;
int n, m;
//vector<pair<int, ll>> adj[MXN+1];
//ll du[MXN+1], dv[MXN+1];
//pair<ll, ll> df[MXN+1][3][3];
//void dijk(int a, ll d[]) {
//for_(i, 0, n) d[i] = INF;
//d[a] = 0;
//priority_queue<pair<ll, int>, deque<pair<ll, int>>, greater<pair<ll, int>>> pq;
//pq.push({0, a});
//while (pq.size()) {
//int p = pq.top().first; ll dist = pq.top().second; pq.pop();
//if (d[p] < dist) continue;
//for (auto i: adj[p]) if (d[i.first] > dist+i.second) {
//d[i.first] = dist+i.second;
//pq.push({d[i.first], i.first});
//}
//}
# | 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... |