제출 #795188

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
795188		finn__	레지스터 (IOI21_registers)	C++17	0 / 100	1 ms	284 KiB

registers

#include "registers.h"
#include <vector>

constexpr size_t B = 2000;
constexpr int ONE = 50, ALL_ONES = 51, MASK = 52;

void construct_instructions(int s, int n, int k, int q)
{
    std::vector<bool> r(B);
    r[0] = 1;
    append_store(ONE, r);
    fill(r.begin() + 1, r.end(), 1);
    append_store(ALL_ONES, r);
    fill(r.begin(), r.end(), 0);
    for (int i = k; i < B; i += k)
        r[i] = 1;
    append_store(MASK, r);

    // writes min in a, max in b
    auto append_swap = [&](int a, int b)
    {
        append_not(40, a);
        append_add(40, 40, ONE);
        append_add(40, 40, b); // 40 : b - a

        append_xor(41, 40, a);
        append_xor(41, 41, b); // 41 : (b - a) ^ a ^ b
        append_and(40, 41, MASK);
        append_right(40, 40, k);
        append_not(40, 40);
        append_add(40, 40, ONE); // 40 : 1-mask if a > b, else 0-mask

        append_xor(41, a, b);
        append_and(42, 40, 41); // 42 : a_i ^ b_i if a_i > b_i
        append_xor(a, a, 42);   // a_i = min(a_i, b_i)
        append_xor(b, b, 42);   // b_i = max(a_i, b_I)
    };

    if (!s)
    {
        int l = 64;
        append_left(2, ALL_ONES, n * k);
        append_or(0, 0, 2);
        append_move(1, 0);
        append_right(0, 0, l * k); // 0 : upper half
        append_left(2, ALL_ONES, l * k);
        append_or(1, 1, 2); // 1 : lower half

        while (l)
        {
            append_swap(0, 1);
            l >>= 1;
            append_move(1, 0);
            append_right(0, 0, l * k);
            append_left(2, ALL_ONES, l * k);
            append_or(1, 1, 2);
        }
    }
    else
    {
    }
}

컴파일 시 표준 에러 (stderr) 메시지

registers.cpp: In function 'void construct_instructions(int, int, int, int)':
registers.cpp:15:23: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
   15 |     for (int i = k; i < B; i += k)
      |                     ~~^~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 25
• Subtask 5: 0 / 13
• Subtask 6: 0 / 29