제출 #1053466

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

registers

#include <bits/stdc++.h>
#include "registers.h"
using namespace std;

typedef long long ll;

vector<bool> num(ll num) {
    vector<bool> res(2000);
    for (int i = 0; i < 2000; i++) {
        ll numBit = min(i, (int)(sizeof(ll)*4)-1);
        res[i] = (num >> numBit) & 1;
    }
    return res;
}

void getMin(int x, int y) {
    append_not(98, y);
    append_add(98, 98, 99);
    append_add(98, x, 98);
    append_right(98, 98, 10);
    append_and(x, x, 98);
    append_not(98, 98);
    append_and(y, y, 98);
    append_or(x, x, y);
}

void construct_instructions(int s, int n, int k, int q) {
    if (n <= 80) {
        append_store(97, num((1 << k) - 1));
        for (int i = 0; i < n-1; i++) {
            append_right(i+1, i, k);
            append_and(i, i, 97);
        }
        append_store(99, num(1));
        for (int i = n-2; i >= 0; i--) {
            getMin(i, i+1);
        }
        return;
    }

    append_store(97, num((1 << k) - 1));
    append_store(99, num(1));
    for (int i = 0; i < n-4; i++) {
        append_right(i+1, i, k);
        append_and(i, i, 97);
    }
    for (int i = n-6; i >= 0; i--) {
        getMin(i, i+1);
    }
    for (int i = n-4; i > n-7; i--) {
        append_right(i-1, i, k);
        append_and(i, i, 99);
    }
    for (int i = n-4; i >= n-7; i--) {
        getMin(0, i);
    }
}

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