# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
122766 | win11905 | Two Transportations (JOI19_transportations) | C++14 | 752 ms | 54856 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 <bits/stdc++.h>
#define iii tuple<int, int, int>
#define pii pair<int, int>
#define x first
#define y second
using namespace std;
namespace {
int N, A;
vector<pii> g[2000];
vector<int> d;
int step, val;
int ns, nid;
int u, v, w;
void dijkstra() {
priority_queue<pii, vector<pii>, greater<pii> > Q;
Q.emplace(d[0] = 0, 0);
while(!Q.empty()) {
auto u = Q.top(); Q.pop();
if(u.x != d[u.y]) continue;
for(auto v : g[u.y]) if(d[v.x] > d[u.y] + v.y)
Q.emplace(d[v.x] = d[u.y] + v.y, v.x);
}
}
}
void InitA(int N, int A, vector<int> U, vector<int> V, vector<int> C) {
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... |