Submission #1063871

#	Time	Username	Problem	Language	Result	Execution time	Memory
1063871		thinknoexit	Alice, Bob, and Circuit (APIO23_abc)	C++17	12 / 100	94 ms	12440 KiB

abc

#include "abc.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;

// 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 (returns la)
int alice(
    const int n,
    const char names[][5],
    const unsigned short numbers[],
    bool outputs_alice[]
) {
    for (int j = 0;j < 16;j++) outputs_alice[j] = (numbers[0] >> j) & 1;
    return 16;
}


// Bob (returns lb)
int bob(
    const int m,
    const char senders[][5],
    const char recipients[][5],
    bool outputs_bob[]
) {
    return m;
}


// Circuit (return l >= la + lb)
int circuit(
    const int la,
    const int lb,
    int operations[],
    int operands[][2],
    int outputs_circuit[][16]
) {
    int sz = la + lb;
    // make one and zero
    operations[sz] = OP_ONE;
    operands[sz][0] = operands[sz][1] = 0;
    sz++;
    operations[sz] = OP_ZERO;
    operands[sz][0] = operands[sz][1] = 0;
    sz++;
    const int ONE = sz - 2;
    const int ZERO = sz - 1;
    // initialize
    int m = lb;
    auto op = [&](int o, int a, int b) {
        operations[sz] = o;
        operands[sz][0] = a;
        operands[sz][1] = b;
        return sz++;
        };
    auto sum = [&](int a[], int b[], int c[]) {
        vector<int> s(16, 0);
        c[0] = op(OP_XOR, a[0], b[0]);
        s[0] = op(OP_AND, a[0], b[0]);
        for (int j = 1;j < 16;j++) {
            c[j] = op(OP_XOR, s[j - 1], op(OP_XOR, a[j], b[j]));
            s[j] = op(OP_AND, op(OP_OR, s[j - 1], a[j]),
                op(OP_AND, op(OP_OR, s[j - 1], b[j]), op(OP_OR, a[j], b[j])));
        }
        };
    int ans[16] = {}, now[16] = {}, num[16] = {};
    for (int j = 0;j < 16;j++) ans[j] = ZERO, num[j] = j;
    for (int i = 0;i < m;i++) { // plus
        sum(ans, num, now);
        for (int j = 0;j < 16;j++) ans[j] = now[j];
    }
    for (int j = 0;j < 16;j++) outputs_circuit[0][j] = ans[j];
    return sz;
}

Compilation message (stderr)

abc.cpp: In function 'int circuit(int, int, int*, int (*)[2], int (*)[16])':
abc.cpp:64:15: warning: unused variable 'ONE' [-Wunused-variable]
   64 |     const int ONE = sz - 2;
      |               ^~~

• 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