# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41210 | MatheusLealV | Commuter Pass (JOI18_commuter_pass) | C++14 | 719 ms | 24484 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 int long long
#define f first
#define s second
#define N 100005
#define inf 2000000000000000000LL
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int n, m, S, T, U, V, visited[N];
ll dist[N][5], from_u[N][5], ans = inf;
vector<pii> grafo[N];
void dijkstra(int x, int f, int flag)
{
priority_queue<pii, vector<pii>, greater<pii> > pq;
for(int i = 1; i <= n; i++) dist[i][f] = inf;
dist[x][f] = 0, pq.push(pii(0, x));
while(!pq.empty())
{
int x = pq.top().s, d = pq.top().f;
pq.pop();
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... |