제출 #970391

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
970391		anton	Alice, Bob, and Circuit (APIO23_abc)	C++17	0 / 100	64 ms	9176 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++){
        if((1<<i) & numbers[0]){
            outputs_alice[i] = true;
        }
    }
    return 16;*/
    return numbers[0];
}


// 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<16; i++){
        if((1<<i) & m){
            outputs_bob[i] = true;
        }
    }
    return 16;*/
    return m;
}

int OP(int a, int b,int tp, int&top, int op[], int operands[][2]){
    op[top] = tp;
    operands[top][0] = a;
    operands[top][1] = b;
    return top++;
}
void add_bits( int carry, deque<int>& lh, deque<int>& rh, deque<int>& dest, int& top, int op[], int operands[][2]){
    if(carry == -1){
        int l = lh.front();
        lh.pop_front();
        int r= rh.front();
        rh.pop_front();
        dest.push_back(OP(l, r, OP_XOR, top, op, operands));
        if(lh.size()>0){
            add_bits(OP(l, r, OP_AND, top, op, operands), lh, rh, dest, top ,op, operands);
        }
    }
    else{
        int l = lh.front();
        lh.pop_front();
        int r= rh.front();
        rh.pop_front();
        
        dest.push_back(OP(carry, OP(l, r, OP_XOR, top, op, operands), OP_XOR, top, op, operands));
        if(lh.size()>0){
            int ab = OP(l, r, OP_AND, top, op, operands);
            int bc = OP(r, carry, OP_AND, top, op, operands);
            int ac = OP(l, carry, OP_AND, top, op, operands);

            add_bits(OP(ab, OP(bc, ac, OP_OR, top, op, operands), OP_OR, top, op, operands), lh,rh, dest, top ,op, operands);
        }
    }

}

void add(deque<int>& lh, deque<int>& rh, deque<int>& dest, int& top, int op[], int operands[][2]){
    add_bits(-1, lh, rh, dest, top ,op, operands);
}
// 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 res= la*lb;
    for(int i =0; i<16; i++){
        if((1<<i) & res){
            operations[i+la+lb] = OP_ONE;
        }
        else{
            operations[i+la+lb] = OP_ZERO;
        }
        operands[i+la+lb][0] = 0;
        operands[i+la+lb][1]= 0;
    }
    for(int i = 0; i<1; i++)
        for(int j = 0; j<16; j++)
            outputs_circuit[i][j] = la+lb+j;
    return la+lb+16;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 4
• Subtask 3: 0 / 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