oj.uz

Submission #974347

# Submission time Handle Problem Language Result Execution time Memory
974347 2024-05-03T09:01:57 Z Pannda Alice, Bob, and Circuit (APIO23_abc) C++17
12 / 100
 37 ms 5112 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

// Alice
int // returns la
alice(
    /*  in */ const int n,
    /*  in */ const char names[][5],
    /*  in */ const unsigned short numbers[],
    /* out */ bool outputs_alice[]
) {
    assert(n == 1);
    for (int i = 0; i < 16; i++) {
        outputs_alice[i] = numbers[0] >> 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[]
) {
    for (int i = 0; i < 10; i++) {
        outputs_bob[i] = m >> i & 1;
    }
    return 10;
}

// 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]
) {

    auto assign = [&](int i, int op, int opr0, int opr1) -> int {
        operations[i] = op;
        operands[i][0] = opr0;
        operands[i][1] = opr1;
        return i;
    };

    auto multiply = [&](int begin, vector<int> is, vector<int> js, vector<int> &result) -> int {
        result.resize(16);
        for (int i = 0; i < 16; i++) {
            result[i] = begin;
            assign(begin, OP_ZERO, 0, 0);
            begin++;
        }
        auto add = [&](auto self, int i, int j, int to) -> void {
            if (to >= 16) return;
            int prod = assign(begin++, OP_AND, i, j);
            self(self, prod, result[to], to + 1);
            result[to] = assign(begin++, OP_XOR, prod, result[to]);
        };
        for (int ii = 0; ii < is.size(); ii++) {
            for (int jj = 0; jj < js.size(); jj++) {
                add(add, is[ii], js[jj], ii + jj);
            }
        }
        return begin;
    };

    vector<int> num(16);
    iota(num.begin(), num.end(), 0);
    vector<int> time(10);
    iota(time.begin(), time.end(), 16);
    vector<int> res;
    assert(la + lb == 26);
    int l = multiply(26, num, time, res);
    for (int i = 0; i < 16; i++) {
        outputs_circuit[0][i] = res[i];
    }

    return l;
}

Compilation message

abc.cpp: In lambda function:
abc.cpp:83:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |         for (int ii = 0; ii < is.size(); ii++) {
      |                          ~~~^~~~~~~~~~~
abc.cpp:84:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |             for (int jj = 0; jj < js.size(); jj++) {
      |                              ~~~^~~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1292 KB Correct!
2 Correct 1 ms 1376 KB Correct!
3 Correct 35 ms 4972 KB Correct!
4 Correct 37 ms 5112 KB Correct!

Subtask #4
0.0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 600 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 600 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 600 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 856 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 856 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1292 KB Correct!
2 Correct 1 ms 1376 KB Correct!
3 Correct 35 ms 4972 KB Correct!
4 Correct 37 ms 5112 KB Correct!
5 Runtime error 1 ms 600 KB Execution killed with signal 6
6 Halted 0 ms 0 KB -