# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
254384 | Sorting | Olympic Bus (JOI20_ho_t4) | C++14 | 356 ms | 4736 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 k_N = 200 + 3;
const int k_M = 5e4 + 3;
const long long k_Inf = 1e17;
int n, m;
long long dist[k_N][k_N];
array<int, 4> edges[k_M];
vector<array<int, 3>> adj[k_N], adj_rev[k_N];
long long d[k_N];
bool in_q[k_N];
bool f1_[k_M], f_n[k_M], f_1[k_M], fn_[k_M];
int par_edge[k_N];
void spfa(int from, int forbidden_idx, vector<array<int, 3>> *adj){
queue<int> q;
for(int i = 1; i <= n; ++i){
d[i] = k_Inf;
in_q[i] = false;
par_edge[i] = -1;
}
d[from] = 0;
q.push(from);
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... |