제출 #1176836

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1176836		thangdz2k7	앨리스, 밥, 서킷 (APIO23_abc)	C++20	62 / 100	412 ms	7272 KiB

abc

#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

const int LG = 16;
const int MAXN = 30;

// Alice
int // returns la
alice(
        /*  in */ const int n,
        /*  in */ const char names[][5],
        /*  in */ const unsigned short numbers[],
        /* out */ bool outputs_alice[]
) {
    map<string,int> hasher;
    for(int i=0;i<n;i++)hasher[names[i]];
    int curr = 0;
    for(auto&[x,y]:hasher)y=curr++;
    for(int i=0;i<n;i++){
        for(int bit=0;bit<16;bit++){
            outputs_alice[16*hasher[names[i]]+bit]=(numbers[i]>>bit)&1;
        }
    }
    int l = 16*n;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            outputs_alice[l+i*30+hasher[names[i]]]=true;
        }
    }
    return l + 30*n;
}


// 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> hasher;
    for(int i=0;i<m;i++)hasher[senders[i]]=hasher[recipients[i]];
    int curr = 0;
    for(auto&hash:hasher)hash.second=curr++;
    for(int i=0;i<m;i++)outputs_bob[hasher[recipients[i]]*30+hasher[senders[i]]]=true;
    return 900;
}

int circuit(
    const int la,
    const int lb,
    int operations[],
    int operands[][2],
    int outputs_circuit[][LG]
) {
    int l = la + lb - 1;
    int n = la / (LG + MAXN);

    auto calc = [&](int oper, int a, int b){
        operations[++ l] = oper;
        operands[l][0] = a;
        operands[l][1] = b;
        return l;
    };

    auto alloc = [&](){
        vector <int> ans(LG);
        for (int i = 0; i < LG; ++ i)
            ans[i] = calc(OP_ZERO, 0, 0);

        return ans;
    };

    auto add = [&](vector <int> a, vector <int> b){
        vector <int> carry(LG);
         carry[0] = calc(OP_ZERO, 0, 0);
        vector <int> ans(LG);

        for (int i = 0; i < LG; ++ i){
            ans[i] = calc(OP_XOR, calc(OP_XOR, a[i], b[i]), carry[i]);
            if (i == 15) continue;

            int tmp1 = calc(OP_AND, a[i], b[i]);
            tmp1 = calc(OP_OR, tmp1, calc(OP_AND, a[i], carry[i]));
            carry[i + 1] = calc(OP_OR, tmp1, calc(OP_AND, b[i], carry[i]));
        }

        return ans;
    };

    auto condicop = [&](vector<int> a,int b){
        for(int&i:a)i = calc(OP_AND,i,b);
        return a;
    };
    auto OR = [&](vector<int> a,vector<int> b){
        for(int i=0;i<a.size();i++)a[i]=calc(OP_OR,a[i],b[i]);
        return a;
    };
    vector<vector<int>> ans(n,alloc());
    vector<vector<int>> fav(n,vector<int>(16));
    for(int i=0;i<n;i++)iota(fav[i].begin(), fav[i].end(),16*i);
    for(int receiver=0; receiver<n;receiver++){
        for(int sender=0;sender<n;sender++){
            ans[receiver] = add(ans[receiver],condicop(fav[sender],la+receiver*30+sender));
        }
    }
    for(int i=0;i<n;i++){
        vector<int> myans = alloc();
        for(int j=0;j<n;j++){
            myans = OR(myans,condicop(ans[j],16*n+30*i+j));
        }
        for(int j = 0; j < 16; ++j)outputs_circuit[i][j] = myans[j];
    }

    return l + 1;
}

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