#include "abc.h"
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include <cassert>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric> //gcd(a,b)
#include<bitset>
#include <cstdlib>
#include <cstdint>
// 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 i=0;i<16;i++){
if(numbers[0]&(1<<i))outputs_alice[i]=1;
else outputs_alice[i]=0;
}
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[]
) {
for(int i=0;i<11;i++){
if(m&(1<<i))outputs_bob[i]=1;
else outputs_bob[i]=0;
}
return 11;
}
// 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]
) {
//test
int id=la+lb;
int rep[la];
for(int i=0;i<la;i++)rep[i]=-1;
auto add=[&](int a,int b,int x){
operations[id]=x;
operands[id][0]=a,operands[id][1]=b;
id++;
return id-1;
};
int one=add(0,1,OP_OR);
for(int i=2;i<la;i++)one=add(i,one,OP_OR);
for(int i=0;i<lb;i++)one=add(i+la,one,OP_OR);
for(int i=0;i<lb;i++)for(int j=0;j<la;j++){
int x=add(j,i+la,OP_AND);
//la=num,lb=multiply
int pos=i+j;
if(pos>=16)continue;
if(rep[pos]==-1)rep[pos]=x;
else{
int last=x;
for(int k=pos;k<la;k++){
int nx=add(last,rep[k],OP_AND);
rep[k]=add(rep[k],last,OP_XOR);
last=nx;
}
//add pos->16 1
}
}
for(int i=0;i<16;i++){
if(rep[i]==-1)assert(0);
outputs_circuit[0][i]=rep[i];
}
return id;
/*
when we are multiplying
if we look at it bit by bit
a,b =shift a->a+b
if its >16 then it will have to be shifted down
but what if that bit is arldy on
then we can find the max consecutive 1s bit and turn the pos+1 to 1
then make everything there 0
*/
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1348 KB |
Correct! |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1348 KB |
Correct! |
2 |
Correct |
0 ms |
1296 KB |
Correct! |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1348 KB |
Correct! |
2 |
Correct |
0 ms |
1296 KB |
Correct! |
3 |
Correct |
36 ms |
5156 KB |
Correct! |
4 |
Correct |
41 ms |
5232 KB |
Correct! |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
1516 KB |
WA Your functions alice(), bob(), circuit() finished successfully, but the final output binary string is incorrect. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
1516 KB |
WA Your functions alice(), bob(), circuit() finished successfully, but the final output binary string is incorrect. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
1516 KB |
WA Your functions alice(), bob(), circuit() finished successfully, but the final output binary string is incorrect. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
130 ms |
9956 KB |
WA Your functions alice(), bob(), circuit() finished successfully, but the final output binary string is incorrect. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
130 ms |
9956 KB |
WA Your functions alice(), bob(), circuit() finished successfully, but the final output binary string is incorrect. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1348 KB |
Correct! |
2 |
Correct |
0 ms |
1296 KB |
Correct! |
3 |
Correct |
36 ms |
5156 KB |
Correct! |
4 |
Correct |
41 ms |
5232 KB |
Correct! |
5 |
Incorrect |
5 ms |
1516 KB |
WA Your functions alice(), bob(), circuit() finished successfully, but the final output binary string is incorrect. |
6 |
Halted |
0 ms |
0 KB |
- |