#include "abc.h"
#include <bits/stdc++.h>
#include <cassert>
#include <iterator>
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
auto ntoi = [](string s) {
int cur = 0;
for (auto a : s) {
cur *= 26;
cur += a + 1 - 'a';
}
return cur;
};
const int maxc = 20, maxn = 16;
// Alice
int // returns la
alice(
/* in */ const int n,
/* in */ const char names[][5],
/* in */ const unsigned short numbers[],
/* out */ bool outputs_alice[]) {
vector<string> vs;
vector<string> num;
for (int i = 0; i < n; i++) {
vs.push_back(bitset<maxc>(ntoi(names[i])).to_string());
num.push_back(bitset<16>(numbers[i]).to_string());
reverse(num.back().begin(), num.back().end());
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < maxc; j++)
outputs_alice[(maxc + maxn) * i + j] = vs[i][j] - '0';
for (int j = 0; j < 16; j++)
outputs_alice[(maxc + maxn) * i + j + maxc] = num[i][j] - '0';
}
return (maxc + maxn) * n;
}
// Bob
int // returns lb
bob(
/* in */ const int m,
/* in */ const char senders[][5],
/* in */ const char recipients[][5],
/* out */ bool outputs_bob[]) {
string s;
for (int i = 0; i < m; i++) {
s += bitset<maxc>(ntoi(senders[i])).to_string();
s += bitset<maxc>(ntoi(recipients[i])).to_string();
}
for (int i = 0; i < s.size(); i++)
outputs_bob[i] = s[i] - '0';
return (maxc + maxc) * m;
}
// 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]) {
const int maxn = 16;
int curfree = la + lb;
auto calc = [&](int op, int op1, int op2) {
operations[curfree] = op;
operands[curfree][0] = op1, operands[curfree][1] = op2;
// cout << curfree << ' ' << op << " " << op1 << " " << op2 << "\n";
int ret = curfree++;
assert(curfree < 2e6);
return ret;
};
auto newnum = [&]() {
vector<int> vi(maxn);
iota(vi.begin(), vi.end(), curfree);
return vi;
};
auto group = [&](int op, vector<int> vi) {
int ans = vi.front();
for (int i = 1; i < vi.size(); i++)
ans = calc(op, vi[i], ans);
return ans;
};
auto checkthree = [&](vector<int> vi) {
int a = calc(OP_AND, vi[0], vi[1]);
int b = calc(OP_AND, vi[0], vi[2]);
int c = calc(OP_AND, vi[1], vi[2]);
int d = calc(OP_OR, a, b);
int e = calc(OP_OR, c, d);
return e;
};
auto add = [&](vector<int> vi, vector<int> vi2) {
vector<int> res, paper(1, calc(OP_ZERO, 0, 0));
for (int i = 0; i < maxn; i++) {
res.push_back(group(OP_XOR, {vi[i], vi2[i], paper[i]}));
if (i != maxn - 1)
paper.push_back(checkthree({vi[i], vi2[i], paper[i]}));
}
return res;
};
auto same = [&](vector<int> vi, vector<int> vi2) {
vector<int> sth;
for (int i = 0; i < vi.size(); i++) {
int ask = calc(OP_XOR, vi[i], vi2[i]);
sth.push_back(calc(OP_NOT_X1, ask, ask));
}
return group(OP_AND, sth);
};
vector<vector<int>> output(la / (maxc + maxn), vector<int>(16));
for (int i = 0; i < la / (maxc + maxn); i++)
for (int j = 0; j < 16; j++)
output[i][j] = calc(OP_ZERO, 0, 0);
for (int i = 0; i < lb / (maxc + maxc); i++)
for (int j = 0; j < la / (maxc + maxn); j++)
for (int k = 0; k < la / (maxc + maxn); k++) {
vector<int> vi1, vi2, vi3, vi4;
for (int l = 0; l < maxc; l++) {
vi1.push_back((maxc + maxn) * j + l);
}
for (int l = 0; l < maxc; l++) {
vi2.push_back((maxc + maxn) * k + l);
}
for (int l = 0; l < maxc; l++) {
vi3.push_back(la + (maxc + maxc) * i + l);
}
for (int l = 0; l < maxc; l++) {
vi4.push_back(la + (maxc + maxc) * i + maxc + l);
}
// for (auto a : vi1)
// cout << a << " ";
// cout << "\n";
// for (auto a : vi2)
// cout << a << " ";
// cout << "\n";
// for (auto a : vi3)
// cout << a << " ";
// cout << "\n";
// for (auto a : vi4)
// cout << a << " ";
// cout << "\n";
int sm = same(vi1, vi3), sm2 = same(vi2, vi4);
int sm3 = calc(OP_AND, sm, sm2);
vector<int> vi5;
for (int l = 0; l < 16; l++) {
vi5.push_back(calc(OP_AND, sm3, (maxc + maxn) * j + maxc + l));
}
output[k] = add(output[k], vi5);
// if (j == 0 && k == 0) {
// }
}
for (int i = 0; i < la / (maxc + maxn); i++) {
for (int j = 0; j < 16; j++)
outputs_circuit[i][j] = output[i][j];
}
// for (int i = 0; i < la / (maxc + maxn); i++) {
// for (int j = 0; j < 16; j++)
// outputs_circuit[i][j] = calc(OP_ZERO, 0, 0);
// }
// outputs_circuit[i][j] = sm2;
return curfree;
}
