# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
364314 | tushar_2658 | Olympic Bus (JOI20_ho_t4) | C++14 | 260 ms | 7904 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;
const int maxn = 205;
using ll = long long;
ll inf = 1e16;
struct E {
int x, id;
ll c, d;
E(int _x, ll _c, ll _d, int _id){
x = _x, c = _c, d = _d;
id = _id;
}
E(){}
};
vector<E> edges[maxn], g[maxn], rev[maxn];
ll dis[2][maxn];
int par[2][maxn];
vector<int> candidates;
int n, m;
void dijkstra(int id, int s){
for(int i = 1; i <= n; ++i)dis[id][i] = -1;
dis[id][s] = 0;
using pii = pair<ll, int>;
vector<bool> vis(n + 1);
while(1){
pii src = {inf, -1};
# | 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... |