제출 #1041329

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1041329		eitanelb	앨리스, 밥, 서킷 (APIO23_abc)	C++17	8 / 100	76 ms	10564 KiB

abc

#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

void write_num(bool * p, int num){
    for(int i=0;i<16;i++){
        p[i] = num&1;
        num>>=1;
    }
}

// Alice
int // returns la
alice(
    /*  in */ const int n,
    /*  in */ const char names[][5],
    /*  in */ const unsigned short numbers[],
    /* out */ bool outputs_alice[]
) {
    //outputs_alice[0] = 0;
    write_num(outputs_alice, numbers[0]);
    //outputs_alice[1] = 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[]
) {
    //outputs_bob[0] = 1;
    //outputs_bob[1] = 1;
    //outputs_bob[2] = 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 e = la+lb;
    if(lb){
        for(int j = 0; j < 16; ++j){
            outputs_circuit[0][j] = j;
        }
        //for(int j = 0; j < 16; ++j) outputs_circuit[0][j] = j;
        return e;
    }
    else{
        operations[16]=0;
        operands[16][0]=0;operands[16][1]=0;
        for(int j = 0; j < 16; ++j) outputs_circuit[0][j] = 16;
        return e+1;
    }
    
    //for(int i=0;i<16;i++) operations[0]=0;
    //operations[5] = 8;
    //operations[6] = 14;
    //operands[5][0] = 0; operands[5][1] = 4;
    //operands[6][0] = 2; operands[6][1] = 5;
    //int final_results[] = {20000, 0, 24464};
    //for(int j = 0; j < 16; ++j) outputs_circuit[0][j] = 0;
    return -1;
}

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