Submission #1157076

#	Time	Username	Problem	Language	Result	Execution time	Memory
1157076		The_Samurai	Alice, Bob, and Circuit (APIO23_abc)	C++20	0 / 100	48 ms	6952 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[]
) {
    return numbers[0];
    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[]
) {
    return m;
    for (int i = 0; i < 10; i++) outputs_bob[i] = m >> i & 1;
    
}


// 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]
) {
    operations[la + lb] = 0;
    operands[la + lb][0] = operands[la + lb][1] = 0;

    operations[la + lb + 1] = 15;
    operands[la + lb + 1][0] = operands[la + lb + 1][1] = 0;
    int ans = la * lb;
    for(int i = 0; i < 1; ++i)
        for(int j = 0; j < 16; ++j)
            outputs_circuit[i][j] = la + lb + (ans >> j & 1);
            // outputs_circuit[i][j] = (final_results[i] >> j & 1);
    // for (int i = 0; i < 3; i++) {
    //     for (int j = 0; j < 16; j++) {
    //         cout << outputs_circuit[i][j];
    //     }
    //     cout << endl;
    // }
    return la + lb + 2;
}

• 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