Submission #959443

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
959443	2024-04-08T08:21:10 Z	zeta7532	Alice, Bob, and Circuit (APIO23_abc)	C++17	8 / 100	131 ms	9928 KB

#include "abc.h"
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
const ll mod = 998244353;
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define faster ios::sync_with_stdio(false);cin.tie(nullptr)

// 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[]
) {
    for(int i=0;i<16;i++){
        outputs_alice[i]=0;
        if(numbers[0]&(1<<i)) outputs_alice[i]=1;
    }
    return 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]=0;
    if(m>=1) outputs_bob[0]=1;
    return 1;
}


// 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;
    for(int i=0;i<1;i++){
        for(int j=0;j<16;j++){
            operations[l]=8;
            operands[l][0]=j;
            operands[l][1]=la;
            outputs_circuit[0][j]=l;
            l++;
        }
    }
    return l;
}

Subtask #1
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1296 KB	Correct!

Subtask #2
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1296 KB	Correct!
2	Correct	1 ms	1296 KB	Correct!

Subtask #3
0.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1296 KB	Correct!
2	Correct	1 ms	1296 KB	Correct!
3	Incorrect	41 ms	4936 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

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	5 ms	1512 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

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	5 ms	1512 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

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	5 ms	1512 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

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	131 ms	9928 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

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	131 ms	9928 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1296 KB	Correct!
2	Correct	1 ms	1296 KB	Correct!
3	Incorrect	41 ms	4936 KB	WA Your functions alice(), bob(), circuit() finished successfully, but the final output binary string is incorrect.
4	Halted	0 ms	0 KB	-

Submission #959443

Compilation message