Submission #978533

#	Time	Username	Problem	Language	Result	Execution time	Memory
978533		yusuf12360	Alice, Bob, and Circuit (APIO23_abc)	C++17	12 / 100	121 ms	23064 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

int alice(const int n, const char a[][5], const unsigned short v[], bool ret[]) {
    for(int i=0; i<16; i++) ret[i]=0;
    for(int i=16, nop=v[0]; i<32; i++, nop>>=1) ret[i]=(nop&1);
    return 32;
}

int bob(const int m, const char u[][5], const char v[][5], bool ret[]) {
    for(int i=0; i<m; i++) ret[i]=0;
    return m;
}

int circuit(const int la, const int lb, int p[], int idx[][2], int ret[][16]) {
    int m=lb, l=la+lb, fi=0, se=16;
    while(m--) {
        for(int k=0; k<16; k++) {
            int now_fi=l; l+=16;
            for(int k1=0; k1<16; k1++) {
                p[now_fi+k1]=OP_XOR;
                idx[now_fi+k1][0]=fi+k1;
                idx[now_fi+k1][1]=se+k1;
            }

            int now_se=l; l+=16;
            p[now_se]=OP_ZERO; idx[now_se][0]=0; idx[now_se][1]=1;
            for(int k1=1; k1<16; k1++) {
                p[now_se+k1]=OP_AND;
                idx[now_se+k1][0]=fi+k1-1;
                idx[now_se+k1][1]=se+k1-1;
            }

            fi=now_fi;
            se=now_se;
        }
        se=16;
    }
    for(int i=0; i<16; i++) ret[0][i]=fi+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