제출 #775445

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

registers

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

const int PLUS_ONE = 99;
const int CARRY_BITS = 98;
const int PADDING = 97;
const int TMP1 = 96;
const int TMP2 = 95;
int S, N, K;

void order(int A, int B) {
	append_print(A);
	append_print(B);
	append_not(TMP1, A);
	append_add(TMP1, TMP1, B);
	append_add(TMP1, TMP1, PLUS_ONE);
	append_xor(TMP1, TMP1, A);
	append_xor(TMP1, TMP1, B);
	append_and(TMP1, TMP1, CARRY_BITS);
	append_right(TMP2, TMP1, K);
	append_not(TMP2, TMP2);
	append_add(TMP1, TMP1, TMP2);
	append_add(TMP1, TMP1, PLUS_ONE);
	append_move(TMP2, A);
	append_xor(TMP2, TMP2, B);
	append_and(TMP2, TMP2, TMP1);
	append_xor(A, A, TMP2);
	append_xor(B, B, TMP2);
}

void construct_instructions(int _S, int _N, int _K, int Q) {
	S = _S;
	N = _N;
	K = _K;
	{
		vector<bool> bits(2000);
		bits[0] = 1;
		append_store(PLUS_ONE, bits);
	}
	{
		vector<bool> bits(2000);
		for (int i = 1; i <= N; i++) {
			bits[i * K] = 1;
		}
		append_store(CARRY_BITS, bits);
	}
	if (S == 0) {
		while (N > 1) {
			append_right(1, 0, (N / 2) * K);
			order(0, 1);
			N = (N + 1) / 2;
		}
	}
}

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