# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
730251 | t6twotwo | Mechanical Doll (IOI18_doll) | C++17 | 1 ms | 300 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 "doll.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> F(int n) {
vector<int> a(1 << n), b;
for (int i = 0; i < (1 << n); i++) {
int j = 0;
while(j < (1 << n)) {
a[j] ^= 1;
j = 2 * j + 1 - a[j];
}
b.push_back(j - (1 << n));
}
return b;
}
void create_circuit(int M, vector<int> A) {
int N = A.size();
vector<int> C(M + 1, -1), X(15), Y(15);
for (int i = 0; i < 7; i++) {
X[i] = -2 * (i + 1);
Y[i] = -2 * (i + 1) - 1;
}
C[0] = A[0];
auto a = F(3);
for (int i = 0; i < 8; i++) {
X[a[i] + 7] = A[i + 1];
}
for (int i = 0; i < 7; i++) {
Y[a[i] + 7] = A[i + 9];
}
Y[a[7] + 7] = 0;
answer(C, X, Y);
}
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... |