oj.uz

Submission #437666

# Submission time Handle Problem Language Result Execution time Memory
437666 2021-06-26T19:35:21 Z ecnerwala Bit Shift Registers (IOI21_registers) C++17
100 / 100
 1 ms 332 KB 
#include "registers.h"

#include <bits/stdc++.h>

void construct_instructions(int S, int N, int K, int Q) {
	const int B = 2000;

	{
		std::vector<bool> tmp(B);
		std::fill(tmp.begin()+N*K, tmp.end(), true);
		append_store(1, tmp);
		append_or(0, 0, 1);
	}

	int L = 8*sizeof(N) - __builtin_clz(N-1);
	N = (1 << L);

	if (S == 0) {
		const int K_MSK = 99;
		{
			std::vector<bool> tmp(B);
			for (int i = 0; i < B; i += K) tmp[i] = true;
			append_store(K_MSK, tmp);
		}

		while (N > 1) {
			append_right(1, 0, N/2*K);
			append_xor(2, 0, 1);
			append_not(3, 0);
			append_add(3, 3, 1);
			append_xor(3, 3, 2);
			append_and(3, 3, K_MSK);
			append_right(4, 3, K);
			append_not(4, 4);
			append_add(3, 3, 4);
			append_and(2, 2, 3);
			append_xor(0, 0, 2);
			N /= 2;
		}
	} else if (S == 1) {
		const int K_MSK_OFF = 90;
		for (int p = 0; p < L; p++) {
			std::vector<bool> tmp(B);
			tmp[0] = true;
			for (int i = 0; (i+1)*K < B; i ++) tmp[(i+1)*K] = !((i >> p) & 1);
			append_store(K_MSK_OFF+p, tmp);
		}
		for (int z = 0; z < L; z++) {
			for (int p = z; p >= 0; p--) {
				append_right(1, 0, (1 << p) * K);
				append_xor(2, 0, 1);
				append_not(3, 0);
				append_add(3, 3, 1);
				append_xor(3, 3, 2);
				if (z+1 < L) {
					append_xor(3, 3, K_MSK_OFF + z+1);
					append_not(3, 3);
				}
				append_and(3, 3, K_MSK_OFF + p);
				append_right(4, 3, K);
				append_not(4, 4);
				append_add(3, 3, 4);
				append_and(2, 2, 3);
				append_xor(0, 0, 2);
				append_left(2, 2, (1 << p) * K);
				append_xor(0, 0, 2);
			}
		}
	} else assert(false);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct