# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
673706 | rainboy | Two Transportations (JOI19_transportations) | C++17 | 859 ms | 55316 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 "Azer.h"
#include <cstring>
#include <vector>
using namespace std;
typedef vector<int> vi;
namespace A {
int min(int a, int b) { return a < b ? a : b; }
const int N = 2000, INF = 0x3f3f3f3f;
int ww[N][N], dd[N], n, n1, d_, s, k, z; char used[N];
void relax(int i, int d) {
dd[i] = d, used[i] = 1;
for (int j = 0; j < n; j++)
if (!used[j])
dd[j] = min(dd[j], dd[i] + ww[i][j]);
}
int nxt() {
int i_ = -1;
for (int i = 0; i < n; i++)
if (!used[i] && dd[i] != INF && (i_ == -1 || dd[i_] > dd[i]))
i_ = i;
return i_;
}
}
void InitA(int n_, int m, vi ii, vi jj, vi ww_) {
A::n = n_, A::n1 = 0;
for (int i = 0; i < A::n; i++)
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |