| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 693321 | rainboy | Memory 2 (JOI16_memory2) | C++17 | 1 ms | 212 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 "Memory2_lib.h"
#include <string.h>
const int N = 50;
int ei[N][2], eo[N];
void append(int a, int i) {
ei[a][eo[a]++] = i;
}
int qu[N * 2];
void Solve(int t, int n) {
t = t;
memset(eo, 0, n * sizeof *eo);
int cnt = 0;
for (int i = 0; i < n * 2; i++)
qu[cnt++] = i;
while (cnt)
if (cnt == 1) {
int i = qu[--cnt];
for (int a = 0; a < n; a++)
if (eo[a] == 1) {
append(a, i);
break;
}
} else if (cnt == 2) {
int i = qu[--cnt], j = qu[--cnt];
bool done = false;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||