제출 #978299

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
978299		Unforgettablepl	앨리스, 밥, 서킷 (APIO23_abc)	C++17	32 / 100	389 ms	481172 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

// Alice
int // returns la
alice(
        /*  in */ const int n,
        /*  in */ const char names[][5],
        /*  in */ const unsigned short numbers[],
        /* out */ bool outputs_alice[]
) {
    vector<pair<string,int>> arr(n);
    for(int i=0;i<n;i++)arr[i]={names[i],numbers[i]};
    sort(arr.begin(), arr.end());
    for(int i=0;i<n;i++){
        for(int bit=0;bit<16;bit++){
            if(arr[i].second&(1<<bit))outputs_alice[16*i+bit]=true;
        }
    }
    return 16*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;
}


// 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 l = la+lb-1;
    int n = la/16;
    auto cal = [&](int oper,int a,int b){
        operations[++l] = oper;
        operands[l][0] = a;
        operands[l][1] = b;
        return l;
    };
    auto alloc = [&](){
        // Allocates 16 bits of zero memory
        vector<int> ans(16);
        for(int i=0;i<16;i++){
            ans[i]=cal(OP_ZERO,0,0);
        }
        return ans;
    };
    auto add = [&](vector<int> a,vector<int> b){
        vector<int> carry(16);carry[0]=cal(OP_ZERO,0,0);
        vector<int> ans(16);
        for(int bit=0;bit<16;bit++){
            ans[bit] = cal(OP_XOR,cal(OP_XOR,a[bit],b[bit]),carry[bit]);
            if(bit==15)continue;
            int temp1 = cal(OP_AND,cal(OP_AND,a[bit],b[bit]),carry[bit]);
            int temp2 = cal(OP_OR,cal(OP_OR,a[bit],b[bit]),carry[bit]);
            temp2 = cal(OP_AND,temp2,cal(OP_NOT_X0,ans[bit],ans[bit]));
            carry[bit+1] = cal(OP_OR,temp1,temp2);
        }
        return ans;
    };
    auto condicop = [&](vector<int> a,int b){
        vector<int> ans(16);
        for(int bit=0;bit<16;bit++){
            ans[bit] = cal(OP_AND,a[bit],b);
        }
        return ans;
    };
    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++)for(int j = 0; j < 16; ++j)outputs_circuit[i][j] = ans[i][j];
    return l+1;
}

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