# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
901333 | nguyentunglam | Two Transportations (JOI19_transportations) | C++17 | 532 ms | 48892 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 <vector>
#include<bits/stdc++.h>
using namespace std;
const int M1 = 9, M2 = 11;
int loop;
namespace {
const int N = 2e3 + 10;
int n;
int pre;
int d[N];
bool mark[N];
vector<pair<int, int> > adj[N];
#define ii pair<int, int>
priority_queue<ii, vector<ii>, greater<ii> > q;
void init () {
mark[0] = 1;
d[0] = 0;
for(int i = 1; i < n; i++) mark[i] = 0, d[i] = (1 << 20) - 1;
for(auto &it : adj[0]) {
int v, w; tie(v, w) = it;
q.push({d[v] = w, v});
}
}
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... |