# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112232 | ainta | Two Transportations (JOI19_transportations) | C++17 | 2132 ms | 110832 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>
namespace AAA{
int N, r1 = 0, r2 = 0;
int w[2010][2010], D[2010], vis[2010];
int count = 0, bef = 0, ccc = 0, cur = 0, cpv = 0;
void Make(int num, int x) {
if (num == 9)ccc++;
int i;
for (i = 0; i < num; i++) {
SendA((x >> i) & 1);
}
}
void Calc() {
int i, Mn = 1e8, pv = -1, diff;
for (i = 0; i < N; i++) {
if (Mn > D[i] && !vis[i]) {
Mn = D[i], pv = i;
}
}
cur = Mn;
cpv = pv;
if (pv == -1) diff = 511, pv = 2047;
}
void receive(bool x) {
int tt = x;
count++;
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... |