제출 #1063938

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

abc

#include "abc.h"
#include <map>
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <array>
#include <cassert>
#include <tuple>
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

#include <vector>
#include <string>

// Alice
int // returns la
alice(
    /*  in */ const int n,
    /*  in */ const char names[][5],
    /*  in */ const unsigned short numbers[],
    /* out */ bool outputs_alice[]
    ) {
  vector<tuple<string, int, int> > bruh;
  for (int i = 0; i < n; ++i)
    bruh.emplace_back(names[i], numbers[i], i);
  sort(bruh.begin(), bruh.end());

  for (int k = 0; k < n; ++k)
    for (int j = 0; j < 16; ++j)
      outputs_alice[j + k * 16] = (get<1>(bruh[k]) >> j) & 1;

  int P[30] {};
  for (int i = 0; i < n; ++i) P[get<2>(bruh[i])] = i;
  for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) outputs_alice[16 * 30 + i * 30 + j] = P[i] == j;
  for (int i = 0; i < 5; ++i) outputs_alice[16 * 30 + 30 * 30 + i] = (n >> i) & 1;
  return 16 * 30 + 30 * 30 + 5;
}

// Bob
int // returns lb
bob(
    /*  in */ const int m,
    /*  in */ const char senders[][5],
    /*  in */ const char recipients[][5],
    /* out */ bool outputs_bob[]
   ) {

  map<string, int> x;
  for (int i = 0; i < m; ++i) x[senders[i]], x[recipients[i]];
  int c{};
  for (auto &[n, p]: x) p = c++;

  for (int i = 0; i < 900; ++i) outputs_bob[i] = 0;
  for (int i = 0; i < m; ++i)
    outputs_bob[x[senders[i]] * 30 + x[recipients[i]]] = 1;

  return 900;
}

// 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, 30000> 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) put(((num >> j) & 1) ? OP_ONE : OP_ZERO, 0, 0); return x - bit; };
  auto c_le = [&](int i, int j, int bit) { int l0 = num[0], l1 = num[0]; for (int I = i + bit - 1, J = j + bit - 1; I >= i; --I, --J) { l0 = put(OP_OR, l0, put(OP_AND, put(OP_NOT_X1, num[0], l1), put(OP_LESS, I, J))); l1 = put(OP_OR, l1, put(OP_XOR, I, J)); } return l0; };
  auto c_add = [&](int i, int j, int bit) { int X = x; x += 6 * bit; int C = num[0]; for (int k = 0, A = i, B = j; k < bit; ++k, ++A, ++B) { put(OP_XOR, put2(OP_XOR, A, B, X), C); int ab = put2(OP_AND, A, B, X); int bc = put2(OP_AND, B, C, X); int ca = put2(OP_AND, C, A, X); C = put2(OP_OR, put2(OP_OR, ab, bc, X), ca, X); } return x - bit; };
  auto c_eq = [&](int i, int j, int bit) {
    int l0 = num[1]; for (int I = i + bit - 1, J = j + bit - 1; I >= i; --I, --J) l0 = put(OP_AND, l0, put(OP_EQUAL, I, J)); return l0; };
  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; };

  for (int i = 0; i <= 25; ++i) num[i] = c_const(i, 16);

  int results[30] {}, poscost[900] {}, posto[900] {};
  for (int i = 0; i < 30; ++i)
    for (int j = 0; j < 30; ++j) {
      poscost[i*30+j] = x;
      for (int k = 0; k < 16; ++k) {
        int l = x++;
        operations[l] = OP_OR;
        operands[l][0] = 16 * i + k;
        operands[l][1] = num[0];
      }
    }

  for (int i = 0; i < 30; ++i)
    for (int j = 0; j < 30; ++j) {
      posto[i*30+j]=x;
      for (int k = 0; k < 16; ++k) {
        int l = x++;
        operations[l] = ((j >> k) & 1) ? OP_ONE: OP_ZERO;
        operands[l][0] = operands[l][1] = num[0];
      }
    }

  for (int i = 0; i < 30; ++i) results[i] = num[0];

  for (int i = 0; i < 900; ++i)
    for (int j = 0; j < 30; ++j)
      results[j] = c_add(results[j], 
                c_and(poscost[i], put(OP_AND, la + i, c_eq(num[j], posto[i], 16)), 16), 16);


  int reresult[30] {};
  for (int i = 0; i < 30; ++i) reresult[i] = num[0];

  int perm_info = 16 * 30;
  for (int i = 0; i < 30; ++i) {
    for (int j = 0; j < 30; ++j) {
      reresult[i] = c_add(reresult[i], c_and(results[j], perm_info + i * 30 + j, 16), 16);
    }
  }

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

컴파일 시 표준 에러 (stderr) 메시지

abc.cpp: In function 'int circuit(int, int, int*, int (*)[2], int (*)[16])':
abc.cpp:93:8: warning: variable 'c_le' set but not used [-Wunused-but-set-variable]
   93 |   auto c_le = [&](int i, int j, int bit) { int l0 = num[0], l1 = num[0]; for (int I = i + bit - 1, J = j + bit - 1; I >= i; --I, --J) { l0 = put(OP_OR, l0, put(OP_AND, put(OP_NOT_X1, num[0], l1), put(OP_LESS, I, J))); l1 = put(OP_OR, l1, put(OP_XOR, I, J)); } return l0; };
      |        ^~~~

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 0 / 4
• Subtask 4: 24 / 24
• Subtask 5: 24 / 24
• Subtask 6: 0 / 6
• Subtask 7: 0 / 18
• Subtask 8: 0 / 10
• Subtask 9: 0 / 6