# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
218927 | PeppaPig | Olympic Bus (JOI20_ho_t4) | C++14 | 358 ms | 3320 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 long long long
#define pii pair<int, int>
#define x first
#define y second
using namespace std;
const int N = 205;
const int M = 5e4+5;
int n, m;
vector<pii> g[N];
array<int, 4> E[M];
long dp[N];
priority_queue<pii, vector<pii>, greater<pii> > Q;
long dijkstra(int s, int e, int i) {
fill_n(dp, N, 1e18);
Q.emplace(dp[s] = 0, s);
while(!Q.empty()) {
pii u = Q.top(); Q.pop();
if(dp[u.y] != u.x) continue;
for(pii v : g[u.y]) {
if(v.y == i) continue;
if(u.x + E[v.y][2] < dp[v.x])
Q.emplace(dp[v.x] = u.x + E[v.y][2], v.x);
}
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... |