# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
296814 | Bruteforceman | Olympic Bus (JOI20_ho_t4) | C++11 | 1093 ms | 163832 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;
long long d[222][222];
vector <int> g[222], t[222];
int l[50010], r[50010], c[50010], db[50010];
int n, m;
const long long inf = 1e16;
struct data {
int node;
long long dist;
data (int node, long long dist) : node(node), dist(dist) {}
data () {}
bool operator < (data d) const {
return dist > d.dist;
}
};
vector <long long> shortest_path(int src, int del) {
priority_queue <data> Q;
Q.push(data(src, 0));
vector <long long> dist (n + 1, inf);
dist[src] = 0;
while(!Q.empty()) {
data u = Q.top();
Q.pop();
for(auto e : g[u.node]) {
if(e == del) continue;
int y = r[e];
if(u.dist + c[e] < dist[y]) {
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... |