Submission #793427

#	Time	Username	Problem	Language	Result	Execution time	Memory
793427		mathematik	Bit Shift Registers (IOI21_registers)	C++17	0 / 100	1 ms	300 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 FINAL_SHIFT 8
#define ZERO 9
#define ALL 10
#define FIRST 12
#define SECOND 13
#define MASK_FIRST 14
#define MASK_SECOND 15
#define MAGIC 16

using namespace std;

void construct_instructions(int s, int n, int k, int q) {
	vector<bool> first(LEN);
	vector<bool> second(LEN);
	for (int i = 0; i < n; i += 1)
	{
		for (int j = i * k; j < (i + 1) * k; j++)
		{
			(i % 2 ? second : first)[j] = true;
		}
	}

	vector<bool> all(2000);
	for (int i = 0; i < n * k; i++)
	{
		all[i] = true;
	}
	append_store(ALL, all);

	append_store(MASK_FIRST, first);
	append_store(MASK_SECOND, second);

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

	append_store(ONE, one);

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

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

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

	if (s == 0) {
		for (int bit = 0; bit < k; bit++)
		{
			append_left(MASK, MASK, 1);
			append_and(TOO_BIG, INPUT, MASK);
			append_right(TOO_BIG, TOO_BIG, k - 1 - bit);

			append_and(FIRST, TOO_BIG, MASK_FIRST);
			append_and(SECOND, TOO_BIG, MASK_SECOND);

			append_add(FIRST, FIRST, MASK_FIRST);
			append_add(SECOND, SECOND, MASK_SECOND);

			append_and(FIRST, FIRST, MASK_FIRST);
			append_and(SECOND, SECOND, MASK_SECOND);

			append_or(REMOVE_MASK, FIRST, SECOND);
			append_not(REMOVE_MASK, REMOVE_MASK);

			append_and(REMOVE_MASK, REMOVE_MASK, ALL);

			append_add(NOT_REMOVE, REMOVE_MASK, MAGIC);

			append_right(NOT_REMOVE, NOT_REMOVE, n * k);

			append_and(REMOVE_MASK, REMOVE_MASK, NOT_REMOVE);
		
			append_or(INPUT, INPUT, REMOVE_MASK);
		}

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

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

	if (s == 1) {

	}
}

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