| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1176828 | thangdz2k7 | Alice, Bob, and Circuit (APIO23_abc) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
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
const int LG = 16;
const int MAXN = 30;
int alice(
const int n,
const char name[][5],
const unsigned short numbers[],
bool outputs_alice[]
) {
map <string, int> hasher;
for (int i = 0; i < n; ++ i)
hasher[name[i]];
int cur = 0;
for (auto &[x, y] : hasher) y = cur ++;
for (int i = 0; i < n; ++ i){
for (int b = 0; b < LG; ++ b)
outputs_alice[hasher[name[i]] * LG + b] = (numbers[i] >> b) & 1;
}
int l = n * LG;
for (int i = 0; i < n; ++ i)
outputs_alice[l + i * MAXN + hasher[name[i]]] = true;
return l + MAXN * n;
}
int bob(
const int m,
const char senders[][5],
const char recipients[][5],
bool outputs_bob[]
) {
map <string, int> hasher;
for (int i = 0; i < m; ++ i)
hasher[senders[i]] = hasher[recipients[i]];
int cur = 0;
for (auto &[x, y] : hasher) y = cur ++;
for (int i = 0; i < m; ++ i)
outputs_bob[hasher[senders[i]] * MAXN + hasher[recipients[i]]] = true;
return 900;
}
int circuit(
const int la,
const int lb,
int operations[],
int operands[][2],
int outputs_circuit[][LG]
) {
int l = la + lb - 1;
int n = la / (LG + MAXN);
auto calc = [&](int oper, int a, int b){
operations[++ l] = oper;
operands[l][0] = a;
operands[l][1] = b;
return l;
};
auto alloc = [&](){
vector <int> ans(LG);
for (int i = 0; i < LG; ++ i)
ans[i] = calc(OP_ZERO, 0, 0);
return ans;
};
auto add = [&](vector<int> a,vector<int> b){
vector<int> carry(16);carry[0]=cal(OP_ZERO,0,0);
vector<int> ans(16);
for(int bit=0;bit<16;bit++){
ans[bit] = cal(OP_XOR,cal(OP_XOR,a[bit],b[bit]),carry[bit]);
if(bit==15)continue;
int temp1 = cal(OP_AND,cal(OP_AND,a[bit],b[bit]),carry[bit]);
int temp2 = cal(OP_OR,cal(OP_OR,a[bit],b[bit]),carry[bit]);
temp2 = cal(OP_AND,temp2,cal(OP_NOT_X0,ans[bit],ans[bit]));
carry[bit+1] = cal(OP_OR,temp1,temp2);
}
return ans;
};
auto condicop = [&](vector<int> a,int b){
for(int&i:a)i = calc(OP_AND,i,b);
return a;
};
auto OR = [&](vector<int> a,vector<int> b){
for(int i=0;i<a.size();i++)a[i]=calc(OP_OR,a[i],b[i]);
return a;
};
vector<vector<int>> ans(n,alloc());
vector<vector<int>> fav(n,vector<int>(16));
for(int i=0;i<n;i++)iota(fav[i].begin(), fav[i].end(),16*i);
for(int receiver=0; receiver<n;receiver++){
for(int sender=0;sender<n;sender++){
ans[receiver] = add(ans[receiver],condicop(fav[sender],la+receiver*30+sender));
}
}
for(int i=0;i<n;i++){
vector<int> myans = alloc();
for(int j=0;j<n;j++){
myans = OR(myans,condicop(ans[j],16*n+30*i+j));
}
for(int j = 0; j < 16; ++j)outputs_circuit[i][j] = myans[j];
}
return l + 1;
}