이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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)
// 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 bit=0;bit<16;bit++){
if(numbers[0]&(1<<bit))outputs_alice[bit]=true;
}
return 16;
}
// Bob
int // returns lb
bob(
/* in */ const int m,
/* in */ const char senders[][5],
/* in */ const char recipients[][5],
/* out */ bool outputs_bob[]
) {
outputs_bob[0] = m&1;
return 1;
}
// 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 l = la+lb-1;
auto cal = [&](int oper,int a,int b){
operations[++l] = oper;
operands[l][0] = a;
operands[l][1] = b;
return l;
};
auto alloc = [&](){
// Allocates 16 bits of zero memory
vector<int> ans(16);
for(int i=0;i<16;i++){
ans[i]=cal(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_XOR,cal(OP_XOR,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){
vector<int> ans(16);
for(int bit=0;bit<16;bit++){
ans[bit] = cal(OP_AND,a[bit],b);
}
return ans;
};
auto multiply = [&](vector<int> a,vector<int> b){
vector<int> curr = alloc();
for(int bit=0;bit<16;bit++){
auto copa = condicop(a,b[bit]);
curr = add(curr,copa);
// TODO Right shift
a.emplace(a.begin(),cal(OP_ZERO,0,0));
a.erase(--a.end());
}
return curr;
};
vector<int> a(16);iota(a.begin(),a.end(),0);
auto ans = condicop(a,la);
for(int j = 0; j < 16; ++j)outputs_circuit[0][j] = ans[j];
return l+1;
}
컴파일 시 표준 에러 (stderr) 메시지
abc.cpp: In function 'int circuit(int, int, int*, int (*)[2], int (*)[16])':
abc.cpp:93:10: warning: variable 'multiply' set but not used [-Wunused-but-set-variable]
93 | auto multiply = [&](vector<int> a,vector<int> b){
| ^~~~~~~~
# | 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... |