# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
708364 | LittleCube | Two Transportations (JOI19_transportations) | C++14 | 912 ms | 48852 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 pii pair<int, int>
#define F first
#define S second
using namespace std;
namespace
{
int N, d[2000] = {}, cnt = 0, ld = 0, u = 0, T, dA, dB;
int phase; // 1: receive distance, 2: receive node
bool vis[2000] = {};
vector<pii> E[2000];
vector<int> receive;
priority_queue<pii, vector<pii>, greater<pii>> pq;
void send(int message, int bit)
{
for (int i = bit - 1; i >= 0; i--)
SendA((message >> i) & 1);
}
void calcNext()
{
cerr << "calcNextA " << u << ' ' << ld << '\n';
T--;
vis[u] = 1;
d[u] = ld;
for (auto [v, w] : E[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... |