#include "abc.h"
#include <array>
#include <cassert>
using namespace std;
// you may find the definitions useful
const int OP_ZERO = 0; // f(OP_ZERO, x0, x1) = 0
const int OP_NOR = 1; // f(OP_NOR, x0, x1) = !(x0 || x1)
const int OP_GREATER = 2; // f(OP_GREATER, x0, x1) = (x0 > x1)
const int OP_NOT_X1 = 3; // f(OP_NOT_X1, x0, x1) = !x1
const int OP_LESS = 4; // f(OP_LESS, x0, x1) = (x0 < x1)
const int OP_NOT_X0 = 5; // f(OP_NOT_X0, x0, x1) = !x0
const int OP_XOR = 6; // f(OP_XOR, x0, x1) = (x0 ^ x1)
const int OP_NAND = 7; // f(OP_NAND, x0, x1) = !(x0 && x1)
const int OP_AND = 8; // f(OP_AND, x0, x1) = (x0 && x1)
const int OP_EQUAL = 9; // f(OP_EQUAL, x0, x1) = (x0 == x1)
const int OP_X0 = 10; // f(OP_X0, x0, x1) = x0
const int OP_GEQ = 11; // f(OP_GEQ, x0, x1) = (x0 >= x1)
const int OP_X1 = 12; // f(OP_X1, x0, x1) = x1
const int OP_LEQ = 13; // f(OP_LEQ, x0, x1) = (x0 <= x1)
const int OP_OR = 14; // f(OP_OR, x0, x1) = (x0 || x1)
const int OP_ONE = 15; // f(OP_ONE, x0, x1) = 1
// Alice
int // returns la
alice(
/* in */ const int n,
/* in */ const char names[][5],
/* in */ const unsigned short numbers[],
/* out */ bool outputs_alice[]
) {
for (int j = 0; j < 16; ++j)
outputs_alice[j] = (numbers[0] >> j) & 1;
return 16 * n;
}
// Bob
int // returns lb
bob(
/* in */ const int m,
/* in */ const char senders[][5],
/* in */ const char recipients[][5],
/* out */ bool outputs_bob[]
) {
for (int j = 0; j < 16; ++j)
outputs_bob[j] = ((m >> j) & 1);
for (int j = 0; j < 26; ++j) {
int e = (senders[j][0] - 'a') * 26 + (recipients[j][0] - 'a') * 26;
for (int k = 0; k < 25; ++k) outputs_bob[16 + j * 25 + k] = (e >> k) & 1;
}
return 16 + m * 25;
}
// Circuit
int // returns l
circuit(
/* in */ const int la,
/* in */ const int lb,
/* out */ int operations[],
/* out */ int operands[][2],
/* out */ int outputs_circuit[][16]
) {
int x { la + lb };
array<int, 1001> num {};
auto put2 = [&](int type, int o1, int o2, int &k) { operations[k] = type; operands[k][0] = o1; operands[k][1] = o2; return k++; };
auto put = [&](int type, int o1, int o2) {return put2(type,o1,o2,x);};
auto c_const = [&](int num, int bit) {
for (int j = 0; j < bit; ++j) put(((num >> j) & 1) ? OP_ONE : OP_ZERO, 0, 0);
return x - bit;
};
auto c_le = [&](int i, int j, int bit) {
int l0 = num[0], l1 = num[0];
for (int I = i + bit - 1, J = j + bit - 1; I >= i; --I, --J) {
l0 = put(OP_OR, l0, put(OP_AND, put(OP_NOT_X1, num[0], l1), put(OP_LESS, I, J)));
l1 = put(OP_OR, l1, put(OP_XOR, I, J));
}
return l0;
};
auto c_add = [&](int i, int j, int bit) {
int X = x;
x += 6 * bit;
int C = num[0];
for (int k = 0, A = i, B = j; k < bit; ++k, ++A, ++B) {
put(OP_XOR, put2(OP_XOR, A, B, X), C);
int ab = put2(OP_AND, A, B, X);
int bc = put2(OP_AND, B, C, X);
int ca = put2(OP_AND, C, A, X);
C = put2(OP_OR, put2(OP_OR, ab, bc, X), ca, X);
}
return x - bit;
};
auto c_eq = [&](int i, int j, int bit) { int l0 = num[0]; for (int I = i + bit - 1, J = j + bit - 1; I >= i; --I, --J) l0 = put(OP_OR, l0, put(OP_XOR, I, J)); return l0; };
auto c_and = [&](int num, int take, int bit) {
for (int j = 0; j < bit; ++j) put(OP_AND, j + num, take);
return x - bit;
};
num[0] = c_const(0, 16);
int EDGE_COST = 19000000, EDGE_TO = 19200000;
int fav[26] {}, results[26] {};
EDGE_COST = x;
for (int i = 0; i < 26; ++i)
for (int j = 0; j < 26; ++j)
for (int k = 0; k < 16; ++k) {
int l = x + i * 26 + j + k;
operations[l] = OP_OR;
operands[l][0] = 16 + 16 * i + k;
operands[l][1] = num[0];
++x;
}
EDGE_TO = x;
for (int i = 0; i < 26; ++i)
for (int j = 0; j < 26; ++j)
for (int k = 0; k < 16; ++k) {
int l = x + i * 26 + j + k;
operations[l] = OP_OR;
operands[l][0] = ((j >> k) & 1) ? OP_ONE: OP_ZERO;
operands[l][1] = num[0];
++x;
}
for (int i = 1; i <= 3000; ++i) num[i] = c_const(i, 16);
for (int i = 0; i < 676; ++i) {
int cost = c_add(lb + i * 25, num[EDGE_COST], 16);
int to = c_add(lb + i * 25, num[EDGE_TO], 16);
for (int j = 0; j < 26; ++j) {
results[j] = c_add(results[j],
c_and(cost, put(OP_AND, c_le(num[j], lb, 16), c_eq(num[j], to, 16)), 16), 16);
}
}
for (int i = 0; i < 26; ++i) for (int j = 0; j < 16; ++j) outputs_circuit[i][j] = results[i] + j;
return x;
}
