# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
487151 | KienTran | Relay Marathon (NOI20_relaymarathon) | C++14 | 2945 ms | 246180 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
using namespace std;
const int O = 3e6 + 5;
const int inf = 1e18;
int n, k, m, E[O], W[O], par[O];
vector <int> g[O];
priority_queue <pair <int, int>, vector <pair <int, int>>, greater <pair <int, int>>> q;
vector <int> Dijktra(vector <int> S){
vector <int> d(n);
for (int i = 0; i < n; ++ i) d[i] = inf, par[i] = 0;
for (int i : S){
d[i] = 0;
par[i] = i;
q.push({0, i});
}
while (q.size()){
int u = q.top().second;
int dist = q.top().first;
q.pop();
if (dist != d[u]) continue;
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... |