oj.uz

Submission #1055962

# Submission time Handle Problem Language Result Execution time Memory
1055962 2024-08-13T06:50:18 Z aykhn Bit Shift Registers (IOI21_registers) C++17
33 / 100
 1 ms 856 KB 
#include "registers.h"
#include <bits/stdc++.h>

using namespace std;

void construct_instructions(int s, int n, int k, int q) {
	if (n == 2 && k <= 2)
	{
		if (k == 1)
		{
			append_right(1, 0, 1);
			append_and(0, 0, 1);
		}
		else
		{
			vector<bool> v(2000, 0);
			v[0] = v[1] = 1;
			append_store(4, v);
			append_right(1, 0, 2);
			append_and(0, 0, 4);
			append_xor(2, 0, 1);
			append_and(2, 2, 1);
			append_right(3, 2, 1);
			append_or(2, 2, 3);
			append_or(1, 2, 1);
	
			append_xor(2, 0, 1);
			append_and(2, 2, 0);
			append_right(3, 2, 1);
			append_or(2, 2, 3);
			append_or(0, 2, 0);
	
			append_and(0, 0, 1);
		}
		return;
	}
	vector<bool> v(2000, 0);
	for (int i = 0; i < k; i++) v[i] = 1;
	append_store(6, v);
	append_move(1, 0);
	append_and(1, 1, 6);
	append_right(0, 0, k);
	for (int i = 1; i < n; i++)
	{
		append_move(2, 0);
		append_and(2, 2, 6);
		append_xor(3, 1, 2);
		for (int j = 1; j < k; j <<= 1)
		{
			append_right(4, 3, j);
			append_or(3, 3, 4);
		}
		append_right(4, 3, 1);
		append_xor(3, 3, 4);

		append_and(4, 1, 3);
		for (int j = 1; j < k; j <<= 1)
		{
			append_right(5, 4, j);
			append_or(4, 4, 5);
		}
		append_or(1, 1, 4);

		append_and(4, 2, 3);
		for (int j = 1; j < k; j <<= 1)
		{
			append_right(5, 4, j);
			append_or(4, 4, 5);
		}
		append_or(2, 2, 4);
		
		append_and(1, 1, 2);

		append_right(0, 0, k);
	}
	append_move(0, 1);
}

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 764 KB Output is correct
3 Correct 1 ms 856 KB Output is correct
4 Correct 1 ms 764 KB Output is correct

Subtask #4
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Wrong answer detected in grader
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Incorrect sorting
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Incorrect sorting
2 Halted 0 ms 0 KB -