# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
516463 | NachoLibre | Olympic Bus (JOI20_ho_t4) | C++17 | 1089 ms | 3232 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>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
const int inf = 2e9;
vector<ll> D(int x, vector<vector<array<int, 3> > > &v, vector<bool> &u, int ub = 0, int bl = 0) {
int n = sz(v) - 1;
vector<ll> d(n + 1, -1);
vector<int> prv(n + 1);
vector<int> pre(n + 1);
d[x] = 0;
set<array<int, 2> > s;
s.insert({0, x});
while(sz(s)) {
int y = (*s.begin())[1];
s.erase(s.begin());
for(array<int, 3> z : v[y]) {
if(z[2] == bl) continue;
if(d[z[0]] == -1 || d[z[0]] > d[y] + z[1]) {
if(d[z[0]] != -1) { s.erase(s.find({(int)d[z[0]], z[0]})); }
d[z[0]] = d[y] + z[1];
prv[z[0]] = y;
pre[z[0]] = z[2];
s.insert({(int)d[z[0]], z[0]});
# | 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... |