Submission #753125

#	Time	Username	Problem	Language	Result	Execution time	Memory
753125		Jarif_Rahman	Alice, Bob, and Circuit (APIO23_abc)	C++17	12 / 100	148 ms	11712 KiB

abc

#include "abc.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

#include "abc.h"

// 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[]
) {
    int x = numbers[0];
    for(int i = 0; i < 16; i++){
        if(x&1) outputs_alice[i] = 1;
        x>>=1;
    }
    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 < 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]
) {
    int N = la+lb;

    auto add = [&](vector<int> A, vector<int> B){
        vector<int> C;
        int carry = -1;
        for(int i = 0; i < 16; i++){

            if(carry == -1){
                operands[N][0] = A[i], operands[N][1] = B[i];
                operations[N] = OP_XOR;
                C.pb(N);

                operands[N+1][0] = A[i], operands[N+1][1] = B[i];
                operations[N+1] = OP_AND;
                carry = N+1;
                N+=2;
            }
            else{
                operands[N][0] = A[i], operands[N][1] = B[i];
                operations[N] = OP_XOR;

                operands[N+1][0] = N, operands[N+1][1] = carry;
                operations[N+1] = OP_XOR;
                C.pb(N+1);

                operands[N+2][0] = N, operands[N+2][1] = carry;
                operations[N+2] = OP_AND;

                operands[N+3][0] = A[i], operands[N+3][1] = B[i];
                operations[N+3] = OP_AND;

                operands[N+4][0] = N+2, operands[N+4][1] = N+3;
                operations[N+4] = OP_OR;
                carry =  N+4;

                N+=5;
            }
        }

        return C;
    };

    vector<int> zero;
    for(int i = 0; i < 16; i++)
        operands[N][0] = 0, operands[N][1] = 0, operations[N] = OP_ZERO, zero.pb(N), N++;

    vector<int> ans = zero, x;
    for(int i = 0; i < 16; i++) x.pb(i);
    for(int i = 1; i <= lb; i++) ans = add(ans, x);

    for(int i = 0; i < 16; i++) outputs_circuit[0][i] = ans[i];
    return N;
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 4 / 4
• Subtask 4: 0 / 24
• Subtask 5: 0 / 24
• Subtask 6: 0 / 6
• Subtask 7: 0 / 18
• Subtask 8: 0 / 10
• Subtask 9: 0 / 6