제출 #991123

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
991123		aryan12	앨리스, 밥, 서킷 (APIO23_abc)	C++17	28 / 100	99 ms	13980 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[]
) {
    // outputs_alice[0] = 1;
    // outputs_alice[1] = 0;
    // return 2;
    for(int i = 0; i < 26; i++) {
        for(int j = 0; j < 16; j++) {
            outputs_alice[16 * i + j] = ((1 << j) & numbers[i]) >> j;
        }
    }
    return 26 * 16;
}
 
 
// Bob
int // returns lb
bob(
    /*  in */ const int m,
    /*  in */ const char senders[][5],
    /*  in */ const char recipients[][5],
    /* out */ bool outputs_bob[]
) {
    // outputs_bob[0] = 1;
    // outputs_bob[1] = 1;
    // outputs_bob[2] = 0;
    // return 3;
    int a[26][26];
    for(int i = 0; i < 26; i++) {
        for(int j = 0; j < 26; j++) {
            a[i][j] = 0;
        }
    }
    for(int i = 0; i < m; i++) {
        int num1 = senders[i][0] - 'a';
        int num2 = recipients[i][0] - 'a';
        a[num1][num2] = 1;
    }
    for(int i = 0; i < 26; i++) {
        for(int j = 0; j < 26; j++) {
            outputs_bob[26 * i + j] = a[i][j];
        }
    }
    return 26 * 26;
}
 
 
// 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]
) {
    // 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[] = {20000, 0, 24464};
    // for(int i = 0; i < 3; ++i)
    //     for(int j = 0; j < 16; ++j)
    //         outputs_circuit[i][j] = 5 + (final_results[i] >> j & 1);
    // return 7;
 
    int cnt = la + lb;
 
    auto full_adder = [&](vector<int> prev_ans, vector<int> add_what, int la, int lb, int carry, int return_what) -> vector<int> {
        vector<int> answers_this_time(16);
        for(int j = 0; j < 16; j++) {
            operations[cnt] = OP_XOR;
            operands[cnt][0] = prev_ans[j];
            operands[cnt][1] = add_what[j];
            cnt += 1;
 
            operations[cnt] = OP_XOR;
            operands[cnt][0] = carry;
            operands[cnt][1] = cnt - 1;
            answers_this_time[j] = cnt;
            cnt += 1;
 
            operations[cnt] = OP_OR;
            operands[cnt][0] = prev_ans[j];
            operands[cnt][1] = add_what[j];
            cnt += 1;
 
            operations[cnt] = OP_AND;
            operands[cnt][0] = carry;
            operands[cnt][1] = cnt - 1;
            cnt += 1;
 
            operations[cnt] = OP_AND;
            operands[cnt][0] = prev_ans[j];
            operands[cnt][1] = add_what[j];
            cnt += 1;
 
            operations[cnt] = OP_OR;
            operands[cnt][0] = cnt - 2;
            operands[cnt][1] = cnt - 1;
            carry = cnt;
            cnt += 1;
        }
 
        for(int j = 0; j < 16; j++) {
            // if cur bit is 0, keep prev_ans
            // cout << "cnt = " << cnt << "\n";
            operations[cnt] = OP_GREATER;
            operands[cnt][0] = prev_ans[j];
            operands[cnt][1] = return_what;
            cnt += 1;
 
            // if cur bit is 1, keep new ans
            operations[cnt] = OP_AND;
            operands[cnt][0] = answers_this_time[j];
            operands[cnt][1] = return_what;
            cnt += 1;
 
            operations[cnt] = OP_OR;
            operands[cnt][0] = cnt - 2;
            operands[cnt][1] = cnt - 1;
            prev_ans[j] = cnt;
            cnt += 1;
        }
        return prev_ans;
    };
 
    vector<vector<int> > prev_ans(26, vector<int> (16, 0));
    for(int i = 0; i < 26; i++) {
        for(int j = 0; j < 16; j++) {
            operations[cnt] = OP_ZERO;
            operands[cnt][0] = 0;
            operands[cnt][1] = 0;
            prev_ans[i][j] = cnt;
            cnt += 1;
        }
    }
    vector<vector<int> > numbers(26, vector<int> (16, 0));
    for(int i = 0; i < 26; i++) {
        for(int j = 0; j < 16; j++) {
            numbers[i][j] = 16 * i + j;
        }
    }
    int carry = cnt;
    operations[cnt] = OP_ZERO;
    operands[cnt][0] = 0;
    operands[cnt][1] = 0;
    cnt += 1;
 
    for(int from = 0; from < 26; from++) {
        for(int to = 0; to < 26; to++) {
            int bob_output = la + from * 26 + to;
            prev_ans[to] = full_adder(prev_ans[to], numbers[from], la, lb, carry, bob_output);
            carry = cnt;
            operations[cnt] = OP_ZERO;
            operands[cnt][0] = 0;
            operands[cnt][1] = 0;
            cnt += 1;
        }
    }
    for(int i = 0; i < 26; i++) {
        for(int j = 0; j < 16; j++) {
            outputs_circuit[i][j] = prev_ans[i][j];
        }
    }
    return cnt;
}

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