답안 #970417

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
970417	2024-04-26T13:43:35 Z	anton	앨리스, 밥, 서킷 (APIO23_abc)	C++17	8 / 100	126 ms	9744 KB

#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

const int MAX_M = 2;

// Alice
int // returns la
alice(
    /*  in */ const int n,
    /*  in */ const char names[][5],
    /*  in */ const unsigned short numbers[],
    /* out */ bool outputs_alice[]
) {
    for(int i = 0; i<16; i++){
        if((1<<i) & numbers[0]){
            outputs_alice[i] = true;
        }
    }
    return 16;
    //return numbers[0];
}


// Bob
int // returns lb
bob(
    /*  in */ const int m,
    /*  in */ const char senders[][5],
    /*  in */ const char recipients[][5],
    /* out */ bool outputs_bob[]
) {
    for(int i = 0; i<m; i++){
        outputs_bob[i]= true;
    }
    return MAX_M;
}

int OP(int a, int b,int tp, int&top, int op[], int operands[][2]){

    op[top] = tp;
    operands[top][0] = a;
    operands[top][1] = b;
    return top++;
}
void add_bits( int carry, deque<int>& lh, deque<int>& rh, deque<int>& dest, int& top, int op[], int operands[][2]){
    if(carry == -1){
        int l = lh.front();
        lh.pop_front();
        int r= rh.front();
        rh.pop_front();
        dest.push_back(OP(l, r, OP_XOR, top, op, operands));
        if(lh.size()>0){
            add_bits(OP(l, r, OP_AND, top, op, operands), lh, rh, dest, top ,op, operands);
        }
    }
    else{
        int l = lh.front();
        lh.pop_front();
        int r= rh.front();
        rh.pop_front();
        
        dest.push_back(OP(carry, OP(l, r, OP_XOR, top, op, operands), OP_XOR, top, op, operands));
        if(lh.size()>0){
            int ab = OP(l, r, OP_AND, top, op, operands);
            int bc = OP(r, carry, OP_AND, top, op, operands);
            int ac = OP(l, carry, OP_AND, top, op, operands);

            add_bits(OP(ab, OP(bc, ac, OP_OR, top, op, operands), OP_OR, top, op, operands), lh,rh, dest, top ,op, operands);
        }
    }

}

void add(deque<int> lh, deque<int>rh, deque<int>& dest, int& top, int op[], int operands[][2]){
    add_bits(-1, lh, rh, dest, top ,op, operands);
}
// 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 top = la+lb;
    deque<int> addend;
    for(int i = 0;i<la; i++){
        addend[i] = i;
    }
    deque<int> base;
    for(int i = 0; i<16; i++){
        base.push_back(OP(0, 0, OP_ZERO, top, operations, operands));
    }
    for(int i = 0; i<MAX_M; i++){
        deque<int> cur_addend;
        for(int j = 0; j<16; j++){
            cur_addend.push_back(OP(la+i, addend[j], OP_AND, top, operations, operands));
        }
        deque<int> res;
        add(base, cur_addend, res, top, operations, operands);
        swap(res, base);
    }

    for(int i = 0; i<1; i++)
        for(int j = 0; j<16; j++)
            outputs_circuit[i][j] = base[j];
    return top;
}

Subtask #1
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1296 KB	Correct!

Subtask #2
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1296 KB	Correct!
2	Correct	1 ms	1252 KB	Correct!

Subtask #3
0.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1296 KB	Correct!
2	Correct	1 ms	1252 KB	Correct!
3	Incorrect	35 ms	5064 KB	WA Your functions alice(), bob(), circuit() finished successfully, but the final output binary string is incorrect.
4	Halted	0 ms	0 KB	-

Subtask #4
0.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	4 ms	1552 KB	WA Your functions alice(), bob(), circuit() finished successfully, but the final output binary string is incorrect.
2	Halted	0 ms	0 KB	-

Subtask #5
0.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	4 ms	1552 KB	WA Your functions alice(), bob(), circuit() finished successfully, but the final output binary string is incorrect.
2	Halted	0 ms	0 KB	-

Subtask #6
0.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	4 ms	1552 KB	WA Your functions alice(), bob(), circuit() finished successfully, but the final output binary string is incorrect.
2	Halted	0 ms	0 KB	-

Subtask #7
0.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	126 ms	9744 KB	WA Your functions alice(), bob(), circuit() finished successfully, but the final output binary string is incorrect.
2	Halted	0 ms	0 KB	-

Subtask #8
0.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	126 ms	9744 KB	WA Your functions alice(), bob(), circuit() finished successfully, but the final output binary string is incorrect.
2	Halted	0 ms	0 KB	-

Subtask #9
0.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1296 KB	Correct!
2	Correct	1 ms	1252 KB	Correct!
3	Incorrect	35 ms	5064 KB	WA Your functions alice(), bob(), circuit() finished successfully, but the final output binary string is incorrect.
4	Halted	0 ms	0 KB	-

답안 #970417

Compilation message