# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
234899 | AlexLuchianov | Two Transportations (JOI19_transportations) | C++14 | 1814 ms | 85944 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 <algorithm>
#include <cassert>
#include <cmath>
#include <queue>
#include <iostream>
using namespace std;
namespace {
int const nmax = 2000;
int const inf = nmax * 500;
int const cost_size = 9;
int const id_size = 11;
int global = 0;
vector<pair<int,int>> g[1 + nmax];
int n;
int dist[1 + nmax], forever[1 + nmax];
priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>> > pq;
}
namespace rec{
int _count = 0;
int wait;
int curr;
vector<int> history;
void waitfor(int _wait){
wait = _wait;
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... |