# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
59022 | tmwilliamlin168 | Commuter Pass (JOI18_commuter_pass) | C++14 | 678 ms | 21356 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 ll long long
#define pli pair<ll, int>
#define fi first
#define se second
const int mxN=1e5;
int n, m, s, t, u, v;
vector<pli> adj[mxN];
ll du[mxN], dv[mxN], ds[mxN], dt[mxN], dp[mxN], ans;
priority_queue<pli, vector<pli>, greater<pli>> pq;
void dijkstra(int s, ll dist[mxN]) {
memset(dist, 0x3F, 8*n);
dist[s]=0;
pq.push({0, s});
while(!pq.empty()) {
pli p=pq.top();
pq.pop();
int u=p.se;
if(p.fi>dist[u])
continue;
for(pli e : adj[u]) {
int v=e.se;
if(dist[u]+e.fi<dist[v]) {
dist[v]=dist[u]+e.fi;
pq.push({dist[v], v});
}
# | 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... |