제출 #793342

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

registers

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

#define LEN 2000
#define INPUT 0
#define MASK 1
#define TOO_BIG 2
#define REMOVE_MASK 3
#define ONE 4
#define NOT_REMOVE 5
#define TOO_BIG_MASK 7
#define FINAL_SHIFT 8
#define ZERO 9

using namespace std;

void construct_instructions(int s, int n, int k, int q) {
	if (s == 0) {
		for (int bit = 0; bit < k; bit++)
		{
			vector<bool> mask(LEN);
			for (int i = 0; i < n; i++)
			{
				mask[i * k] = true;
			}
			append_store(MASK, mask);
			append_left(MASK, MASK, k - 1 - bit);
			append_and(TOO_BIG, INPUT, MASK);
			append_right(TOO_BIG, TOO_BIG, k - 1 - bit);

			for (int i = 0; i < k; i++)
			{
				append_or(REMOVE_MASK, TOO_BIG, REMOVE_MASK);
				append_left(TOO_BIG, TOO_BIG, MASK);
			}

			vector<bool> one(LEN);
			one[0] = true;

			append_store(ONE, one);
			append_add(NOT_REMOVE, REMOVE_MASK, ONE);

			vector<bool> too_big(LEN);
			too_big[n * k] = true;

			append_store(TOO_BIG, too_big);
			append_and(TOO_BIG, TOO_BIG, NOT_REMOVE);

			append_move(TOO_BIG_MASK, TOO_BIG);

			for (int i = 1; i <= n * k; i <<= 1)
			{
				append_right(TOO_BIG, TOO_BIG, i);
				append_or(TOO_BIG_MASK, TOO_BIG_MASK, TOO_BIG);
				append_move(TOO_BIG, TOO_BIG_MASK);
			}

			append_not(TOO_BIG_MASK, TOO_BIG_MASK);
			append_and(REMOVE_MASK, REMOVE_MASK, TOO_BIG_MASK);
		
			append_or(INPUT, INPUT, REMOVE_MASK);
		}
		
		append_not(INPUT, INPUT);
		append_move(FINAL_SHIFT, INPUT);

		vector<bool> zero(LEN);
		for (int i = 0; i < n * k; i++)
		{
			zero[i] = true;
		}
		
		append_store(ZERO, zero);
		append_and(FINAL_SHIFT, FINAL_SHIFT, ZERO);

		for (int i = 1; i <= n; i <<= 1)
		{
			append_right(FINAL_SHIFT, FINAL_SHIFT, k * i);
			append_or(INPUT, INPUT, FINAL_SHIFT);
		}
		
		append_not(INPUT, INPUT);
	}

	if (s == 1) {

	}
}

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