제출 #741405

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

registers

#include <vector>
void append_move(int t, int x);
void append_store(int t, std::vector<bool> v);
void append_and(int t, int x, int y);
void append_or(int t, int x, int y);
void append_xor(int t, int x, int y);
void append_not(int t, int x);
void append_left(int t, int x, int s);
void append_right(int t, int x, int s);
void append_add(int t, int x, int y);
void append_print(int t);
void construct_instructions(int s, int n, int k, int q);

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

void fill (vector<bool>& v) {
	while ((int) v.size() < 2000) v.push_back(0);
}

void construct_instructions(int s, int n, int k, int q) {
	if (s == 0) {
		vector<bool> AND, v1 {1};
		for (int i = 0; i < k; i++) AND.push_back(1);
		fill(AND);
		fill(v1);
		append_store(4, AND);
		append_store(5, v1);
		append_and(1, 0, 4);
		append_right(0, 0, k);
		if (k == 2) {
			append_right(2, 1, 1);
			append_and(3, 1, 5);
			append_xor(3, 2, 3);
			append_xor(2, 0, 1);
			append_add(2, 2, 5);
			append_right(2, 2, 2);
			append_add(2, 2, 3);
			append_right(2, 2, 1);
		}
		append_and(0, 0, 1);
		append_add(0, 0, 2);
	}
}

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