# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
110080 | popovicirobert | Commuter Pass (JOI18_commuter_pass) | C++14 | 902 ms | 24392 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>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44
using namespace std;
const ll INF = 1e18;
vector < vector < pair <int, int> > > g;
vector <ll> dst[4];
int n;
inline void dijkstra(int nod, vector <ll> &dst) {
dst.resize(n + 1);
fill(dst.begin(), dst.end(), INF);
priority_queue < pair <ll, int> > pq;
pq.push({0, nod});
dst[nod] = 0;
vector <bool> vis(n + 1);
fill(vis.begin(), vis.end(), 0);
while(pq.size()) {
pair <ll, int> cur = pq.top();
pq.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... |