Submission #1270051

#	Time	Username	Problem	Language	Result	Execution time	Memory
1270051		Faggi	앨리스, 밥, 서킷 (APIO23_abc)	C++20	12 / 100	111 ms	12828 KiB

abc

#include <bits/stdc++.h>
#define ll long long
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define fr first
#define se second
#define pb push_back
#define mp make_pair
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[]
) {
    ll MOD=65536;
    ll num=numbers[0];
    for(ll j=0; j<1000; j++)
    {
        for(ll i=0; i<16; i++)
            outputs_alice[(j*16)+i]=(1<<i)&num;
        num=(num+numbers[0])%MOD;
    }
    return 16*1000;
}


// Bob
int // returns lb
bob(
    /*  in */ const int m,
    /*  in */ const char senders[][5],
    /*  in */ const char recipients[][5],
    /* out */ bool outputs_bob[]
) {
    for(ll i=0; i<1000; i++)
        outputs_bob[i]=0;
    outputs_bob[m-1]=1;
    return 1000;
}


// 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]
) {
    ll i, j, in=la+lb;
    for(i=0; i<la+lb; i++)
    {
        operations[i]=-1;
        operands[i][0] = -1; operands[i][1] = -1;
    }
    for(j=0; j<1000; j++)
    {
        for(i=0; i<16; i++)
        {
            operations[i+in+(16*j)]=8;
            operands[i+in+(16*j)][0]=(16*j)+i;
            operands[i+in+(16*j)][1]=la+j;
        }
    }
    in=in+16*1000;
    for(j=0; j<999; j++)
    {
        for(i=0; i<16; i++)
        {
            operations[in+i+j*16]=14;
            operands[i+in+(16*j)][0]=i+in+(16*j)-16;
            operands[i+in+(16*j)][1]=i+in+(16*j)-16*1000;
        }
    }
        for(int j = 0; j < 16; ++j)
            outputs_circuit[0][j] = j+in+(16*998);
    return la+lb+1000*16*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