제출 #1214396

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

registers

#include "registers.h"
#include <bits/stdc++.h>

using namespace std;

void construct_instructions(int s, int n, int k, int q) {
    const int m = 100, b = 2000;

    append_not(0, 0); // find max of not instead
    vector<bool> monospaced(b, 0);
    for (int i = 0; i < n; i++) monospaced[i*k] = 1;

    append_store(99, monospaced);
    append_store(1, monospaced); // candidate list

    for (int bit = k-1; bit >= 0; bit--) {
        append_right(2, 0, bit); // bit value
        append_and(2, 2, 1); // bit value & candidate (if not candidate, will be zero)
        append_move(3, 2);

        for (int i = 1; i <= 64; i *= 2){
            append_left(4, 3, i*k);
            append_or(3, 3, 4);
        }
        append_right(4, 3, 100*k);
        append_or(3, 3, 4);
        append_not(3, 3);

        append_or(2, 2, 3);
        append_and(1, 1, 2);
        append_print(1);
    }

    for (int cur = 1; cur < k;) {
        if (2*cur <= k) {
            append_left(2, 1, cur);
            append_or(1, 1, 2);
            cur *= 2;
        } else {
            append_left(2, 1, k-cur);
            append_or(1, 1, 2);
            cur = k;
        }
    }
    append_print(1);

    append_and(0, 0, 1);
    append_print(0);
    for (int i = 1; i <= 64; i *= 2) {
        append_right(1, 0, i*k);
        append_or(0, 0, 1);
    }

    append_not(0, 0);
    append_print(0);
}

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