Submission #874971

#	Time	Username	Problem	Language	Result	Execution time	Memory
874971		Itamar	Alice, Bob, and Circuit (APIO23_abc)	C++17	12 / 100	143 ms	18500 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
using namespace std;
#include <vector>
#define vi vector<int>

void mul(int a, int b,vi &ans) {
    int c = (a * b);
    for (int i = 0; i < 16; i++) {
        ans[i] = c % 2;
        c /= 2;
    }
}
// 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] = 1;
    //outputs_alice[1] = 0;

    for (int i = 0; i <= 1000; i++) {
        vi v(16);
        mul(numbers[0], i, v);
        for (int j = 0; j < 16; j++) {
            outputs_alice[16 * i + j] = v[j];
        }
    }

    return (int)(16*1001);
}


// 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]
) {
    /*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 i = 0; i < 3; ++i)
        for (int j = 0; j < 16; ++j)
            outputs_circuit[i][j] = 5 + (final_results[i] >> j & 1);*/
    int l = la+lb+16;
    for (int i = 0; i < l; i++)operations[i] = 10;
    for (int i = la+lb; i < la+lb+16; i++) {
        operands[i][0] = 16 * lb + (i-la-lb);
        operands[i][1] = 0;
    }
    for (int i = 0; i < 16; i++)outputs_circuit[0][i] = la + lb + i;
    return l;
}

• 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