oj.uz

답안 #764679

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
764679 2023-06-23T21:02:20 Z hossain2020 앨리스, 밥, 서킷 (APIO23_abc) C++17
0 / 100
 34 ms 776 KB 
#include "abc.h"
#include <bits/stdc++.h>

#define ordered_set tree <ll, null_type, less <ll>, rb_tree_tag, tree_order_statistics_node_update>
#define fast ios_base::sync_with_stdio(0);ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define ull unsigned long long
#define ld long double
#define pf push_front
#define pb push_back
#define ll long long
#define endl "\n"
#define S second
#define F first
#define ff cout.flush();
#define all(x) x.begin(),x.end()

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[]
) {
    ll x=0,l=numbers[0];
	for (int i=0;l;i++)
    {
    	outputs_alice[i]=l%2;
        l/=2;
        x++;
    }
    return x;
}


// Bob
int // returns lb
bob(
    /*  in */ const int m,
    /*  in */ const char senders[][5],
    /*  in */ const char recipients[][5],
    /* out */ bool outputs_bob[]
) {
    ll x=0,l=m;
	for (int i=0;l;i++)
    {
    	outputs_bob[i]=l%2;
        l/=2;
        x++;
    }
    return x;
}


// 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]
) {
    ll n,m;
    for (int i=0;i<la;i++)
    {
        n+=((1&operations[i])<<i);
    }
    for (int i=la;i<la+lb;i++)
    {
        m+=((1&operations[i])<<(i-la));
    }
    n=m*n;
    for(int j = 0; j < 16; ++j)
            outputs_circuit[0][j] =  (n >> j & 1);
    return la+lb;
}

Compilation message

abc.cpp: In function 'int circuit(int, int, int*, int (*)[2], int (*)[16])':
abc.cpp:95:6: warning: 'm' may be used uninitialized in this function [-Wmaybe-uninitialized]
   95 |     n=m*n;
      |     ~^~~~
abc.cpp:89:10: warning: 'n' may be used uninitialized in this function [-Wmaybe-uninitialized]
   89 |         n+=((1&operations[i])<<i);
      |         ~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 776 KB Alice lengths are not all equal.
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 776 KB Alice lengths are not all equal.
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 776 KB Alice lengths are not all equal.
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 760 KB Alice lengths are not all equal.
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 760 KB Alice lengths are not all equal.
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 760 KB Alice lengths are not all equal.
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 34 ms 692 KB Alice lengths are not all equal.
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 34 ms 692 KB Alice lengths are not all equal.
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 776 KB Alice lengths are not all equal.
2 Halted 0 ms 0 KB -