제출 #1063802

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1063802		sleepntsheep	앨리스, 밥, 서킷 (APIO23_abc)	C++17	0 / 100	31 ms	2576 KiB

abc

#include "abc.h"
#include <array>
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[]
    ) {
  for (int j = 0; j < 16; ++j)
    outputs_alice[j] = (numbers[0] >> j) & 1;
  return 16;
}


// 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 j = 0; j < 16; ++j)
    outputs_bob[j] = ((m >> j) & 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 x = la + lb;
  array<int, 1001> num;

  auto put2 = [&](int type, int o1, int o2, int &k) { operations[k] = type; operands[k][0] = o1; operands[k][1] = o2; return k; };
  auto put = [&](int type, int o1, int o2) {return put2(type,o1,o2,x);};

  auto c_const = [&](int num, int bit) {
    for (int j = 0; j < bit; ++j) operations[x++] = ((num >> j) & 1) ? OP_ONE : OP_ZERO;
    return x - bit;
  };

  for (int i = 0; i <= 1000; ++i) num[i] = c_const(i, 10);

  auto c_le = [&](int i, int j, int bit) {
    int l0 = put(OP_LESS, num[0], num[0]);
    for (int I = i + bit - 1, J = j + bit - 1; I >= i; --I, --J) l0 = put(OP_OR, l0, put(OP_LESS, I, J));
    return l0;
  };

  auto c_add = [&](int i, int j, int bit) {
    int ab = x, bc = x + bit, ca = x + 2 * bit;
    int ab_p_bc = x + 3 * bit;
    int carry = x + 4 * bit;
    int buf = x + 5 * bit;
    int out = x + 6 * bit;

    int lcarry = num[0];
    for (int k = 0, I = i + k, J = j + k; k < bit; ++k, ++i, ++j) {
      put2(OP_XOR, I, J, buf);
      put2(OP_XOR, buf - 1, carry - 1, out);
      put2(OP_AND, I, J, ab);
      put2(OP_AND, J, lcarry, bc);
      put2(OP_AND, lcarry, I, ca);
      put2(OP_OR, ab - 1, bc - 1, ab_p_bc);
      lcarry = put2(OP_OR, ab_p_bc - 1, ca - 1, carry);
    }
    x = out;
    return out - bit;
  };

  auto c_and = [&](int num, int take, int bit) {
    for (int j = 0; j < bit; ++j) put(OP_AND, j + num, take);
    return x - bit;
  };

  int ans = num[0];
  for (int j = 0; j <= 1000; ++j)
    ans = c_add(ans, c_and(la, c_le(num[j], lb, 10), 16), 16);

  for (int j = 0; j < 16; ++j) outputs_circuit[0][j] = ans + j;
  return x;
}

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