제출 #1186968

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1186968		anmattroi	Alice, Bob, and Circuit (APIO23_abc)	C++17	12 / 100	96 ms	12888 KiB

abc

#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

// 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++) outputs_alice[i] = (numbers[0]>>i&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] = 1;
    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 _cnt = la+lb-1;

    function<int(int, int, int)> addOp = [&](int OP, int x, int y) {
        ++_cnt;
        operations[_cnt] = OP;
        operands[_cnt][0] = x;
        operands[_cnt][1] = y;
        return _cnt;
    };

    function<int(int, const vector<int>&)> addOperation = [&](int OP, const vector<int> &a) {
        assert(a.size() >= 2);

        int last = addOp(OP, a[0], a[1]);
        for (int i = 2; i < a.size(); i++)
            last = addOp(OP, a[i], last);
        return last;
    };

    int nho[16];
    for (int i = 0; i < 16; i++) nho[i] = addOperation(OP_ZERO, {0, 0});

    for (int o = 0; o < lb; o++) {
        int rem = addOperation(OP_ZERO, {0, 0});
        for (int i = 0; i < 16; i++) {
            int A = addOperation(OP_XOR, {nho[i], i, rem}),
                B = addOperation(OP_AND, {nho[i], i, rem}),
                C = addOperation(OP_NOT_X0, {A, A}),
                D = addOperation(OP_OR, {nho[i], i, rem}),
                E = addOperation(OP_AND, {C, D}),
                F = addOperation(OP_OR, {B, E});

            nho[i] = A;
            rem = F;
        }
    }
    for(int i = 0; i < 1; ++i)
        for(int j = 0; j < 16; ++j)
            outputs_circuit[i][j] = nho[j];
    return _cnt+1;
}
//

• 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