제출 #758517

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
758517		rainboy	앨리스, 밥, 서킷 (APIO23_abc)	C++17	4 / 100	146 ms	9740 KiB

abc

#include "abc.h"

const int OP_INPUT   = -1;
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 name[][5], const unsigned short xx[], bool aa[]) {
	aa[0] = 0;
	return 1;
}

int bob(const int m, const char uu[][5], const char vv[][5], bool bb[]) {
	bb[0] = 0;
	return 1;
}

int l;

int add(int op[], int uu[][2], int o, int u, int v) {
	op[l] = o, uu[l][0] = u, uu[l][1] = v;
	return l++;
}

int circuit(const int la, const int lb, int op[], int uu[][2], int outputs_circuit[][16]) {
	l = 0;
	for (int h = 0; h < la + lb; h++)
		add(op, uu, OP_INPUT, -1, -1);
	int u = add(op, uu, OP_ZERO, 0, 1);
	int n = 1;
	for (int h = 0; h < 16; h++)
		outputs_circuit[0][h] = u;
	return l;
}

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

abc.cpp: In function 'int circuit(int, int, int*, int (*)[2], int (*)[16])':
abc.cpp:43:6: warning: unused variable 'n' [-Wunused-variable]
   43 |  int n = 1;
      |      ^

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