# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
851767 | chautanphat | Commuter Pass (JOI18_commuter_pass) | C++11 | 2 ms | 2652 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 io freopen("input.inp", "r", stdin);freopen("output.out", "w", stdout);
using namespace std;
const int maxn = 1e5+1;
int n;
vector< pair<long long, int> > a[maxn];
vector<long long> dijkstra(int start)
{
vector<long long> d(n+1);
d[start] = 0;
priority_queue< pair<long long, int> > q;
q.push(make_pair(0, start));
vector<bool> vs(n+1);
while (q.size())
{
int u = q.top().second;
q.pop();
if (vs[u]) continue;
vs[u] = 1;
for (int i = 0; i < (int)a[u].size(); i++)
{
int v = a[u][i].first, w = a[u][i].second;
if (d[u]+w < d[v])
{
d[v] = d[u]+w;
q.push(make_pair(-d[v], v));
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... |