# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
296849 | matt_H | Two Transportations (JOI19_transportations) | C++14 | 1184 ms | 1712 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 <cstdio>
#include <vector>
#include <queue>
typedef std::pair<int, int> pii;
typedef std::vector<int> vi;
typedef std::vector<pii> vii;
typedef std::vector<vii> vvii;
namespace {
int N, done;
vi dist, alive;
vvii neighbors;
std::priority_queue<pii> dijkQ;
const int INF = 1000000000;
const int INF_W = 511;
int reg;
int other_dist, cur_dist;
int expected, cnt;
enum Event { receivedDist, receivedPoint } event;
void receiveInt(int n, Event e) {
expected = n;
cnt = 0;
reg = 0;
event = e;
}
void sendInt(int n, int to_send) {
# | 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... |