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 "abc.h"
#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
auto ntoi = [](string s) {
int cur = 0;
for (auto a : s) {
cur *= 26;
cur += a - 'a';
}
return cur;
};
// Alice
int // returns la
alice(
/* in */ const int n,
/* in */ const char names[][5],
/* in */ const unsigned short numbers[],
/* out */ bool outputs_alice[]) {
string s = bitset<16>(numbers[0]).to_string();
reverse(s.begin(), s.end());
for (int i = 0; i < n; i++)
for (int j = 0; j < 16; j++)
outputs_alice[16 * i + j] = s[j] - '0';
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 i = 0; i < m; i++)
outputs_bob[i] = 0;
return 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;
int ret = curfree++;
return ret;
};
auto newnum = [&]() {
vector<int> vi(maxn);
iota(vi.begin(), vi.end(), curfree);
curfree += maxn;
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, 0, 1);
int b = calc(OP_AND, 0, 2);
int c = calc(OP_AND, 1, 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;
};
if (lb == 1) {
for (int i = 0; i < maxn; i++) {
outputs_circuit[0][i] = calc(OP_X1, i, i);
// cout << outputs_circuit[0][i] << " " << i << "\n";
}
return curfree;
} else {
int sth = calc(OP_ZERO, 0, 0);
for (int i = 0; i < maxn; i++)
outputs_circuit[0][i] = sth;
return la + lb + 1;
}
}
Compilation message (stderr)
abc.cpp: In lambda function:
abc.cpp:89:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
89 | for (int i = 1; i < vi.size(); i++)
| ~~^~~~~~~~~~~
abc.cpp: In function 'int circuit(int, int, int*, int (*)[2], int (*)[16])':
abc.cpp:80:8: warning: variable 'newnum' set but not used [-Wunused-but-set-variable]
80 | auto newnum = [&]() {
| ^~~~~~
abc.cpp:104:8: warning: variable 'add' set but not used [-Wunused-but-set-variable]
104 | auto add = [&](vector<int> vi, vector<int> vi2) {
| ^~~
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |