# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1097862 | thangdz2k7 | Two Transportations (JOI19_transportations) | C++17 | 615 ms | 49156 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>
#define pb push_back
#include "Azer.h"
using namespace std;
using vi = vector <int>;
using ii = pair <int, int>;
const int N = 2000;
const int inf = 1e9;
const int L = 9;
const int MaxE = (1 << L) - 1;
int n, m, D;
vector <ii> adj[N];
vi dist, used;
void upd(int x){
used[x] = 1;
for (auto [w, v] : adj[x]) dist[v] = min(dist[v], dist[x] + w);
}
int Node, cnt, X, op, Y;
void Send(){
Y = inf; bool ok = false;
for (int u = 0; u < n; ++ u) if (!used[u]){
ok = true;
if (dist[u] < Y) Y = dist[u], Node = u;
}
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... |