Submission #760199

#	Time	Username	Problem	Language	Result	Execution time	Memory
760199		8e7	Alice, Bob, and Circuit (APIO23_abc)	C++17	8 / 100	151 ms	16872 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[]
) {
	unsigned short x = 0, y = numbers[0];
	for (int i = 0;i < 1024;i++) {
		for (int j = 0;j < 16;j++) {
			outputs_alice[i*16 +j] = (x >> j) & 1;
		}
		x += y;
	}
	
    //outputs_alice[0] = 1;
    //outputs_alice[1] = 0;
    return 16000;
}


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



// 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]
) {

	int cnt = la+lb;
	auto op = [&] (int type, int a, int b) {
		operations[cnt] = type;
		operands[cnt][0] = a, operands[cnt][1] = b;
		return cnt++;
	};
	
	auto tristate = [&] (int a, int b, int c) {
		//c'a + cb
		int x = op(OP_GREATER, a, c);
		int y = op(OP_AND, b, c);
		return op(OP_OR, x, y);
	};
	for (int i = 0;i < 16;i++) {
		vector<int> vec(1024);
		for (int k = 0;k < 1024;k++) vec[k] = k*16 + i;
		for (int j = 0;j < 10;j++) {
			vector<int> to(1<<(10-j-1));
			for (int k = 0;k < (1<<(10-j-1));k++) {
				to[k] = tristate(vec[2*k], vec[2*k+1], la + j);
			}
			if (j == 9) outputs_circuit[0][i] = to[0];
			vec = to;
		}
	}
	/*
    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[] = {0, 0, 24464};
    for(int i = 0; i < 1; ++i)
        for(int j = 0; j < 16; ++j)
            outputs_circuit[i][j] = 5 + (final_results[i] >> j & 1);
	*/
    return cnt;
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 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