oj.uz

Submission #1060783

# Submission time Handle Problem Language Result Execution time Memory
1060783 2024-08-15T22:36:09 Z jamjanek Bit Shift Registers (IOI21_registers) C++17
10 / 100
 1 ms 1276 KB 
#include "registers.h"
#include<bits/stdc++.h>
using namespace std;
void construct_instructions(int s, int n, int k, int q) {
	int	iterator = 0;
	vector<bool>jeden(2000, 0);jeden[0] = 1;iterator++;assert(iterator<q);append_store(2, jeden);
	
	iterator++;assert(iterator<q);append_right(99,0,k);
	iterator++;assert(iterator<q);append_left(0, 0, 2000-k), iterator++;assert(iterator<q);append_right(0, 0, 2000-k);
	for(int pow = 0;pow<n-1;pow++){
	//	znajdz 1 rozniaca sie pozycje;
		
		iterator++;assert(iterator<q);append_move(1, 99);//ustaw b
		iterator++;assert(iterator<q);append_left(1, 1, 2000-k), iterator++;assert(iterator<q);append_right(1, 1, 2000-k);

		iterator++;assert(iterator<q);append_print(0), iterator++;assert(iterator<q);append_print(1);
		
		iterator++;assert(iterator<q);append_and(4, 98, 4);
		iterator++;assert(iterator<q);append_and(3, 98, 3);
		
		//0 - a
		//1 - b
		//2 - "1"
		//3 - czy_znaleziono_pozcje
		//4 ktora wieksza
		int i;
		for(i=k-1;i>=0;i--){
			iterator++;assert(iterator<q);append_right(5, 0, i);
			iterator++;assert(iterator<q);append_right(6, 1, i);
			iterator++;assert(iterator<q);append_and(5, 5, 2);//i-ty bit a
			iterator++;assert(iterator<q);append_and(6, 6, 2);//i-ty bit b
			iterator++;assert(iterator<q);append_xor(7, 5, 6);//xor
			iterator++;assert(iterator<q);append_xor(8, 3, 2); // !4
			iterator++;assert(iterator<q);append_and(8, 8, 7), iterator++;assert(iterator<q);append_and(8, 8, 5); 
			iterator++;assert(iterator<q);append_add(4, 4, 8);
			// 1 - jesli b<a
			//3 = (!4) & 7 & 5
			
			iterator++;assert(iterator<q);append_or(3, 3, 7);//czy_znaleziono_poprawione
		}
		iterator++;assert(iterator<q);append_print(3);
		iterator++;assert(iterator<q);append_print(4);
		//3 same 0 jeśli a<b, same 1, jeśli b<a
		iterator++;assert(iterator<q);append_move(3, 4);
		for(i=1;i<k;i++){
			iterator++;assert(iterator<q);append_left(3,3,1);
			iterator++;assert(iterator<q);append_or(3, 3, 4);
		}

		iterator++;assert(iterator<q);append_and(4, 0, 3);
		iterator++;assert(iterator<q);append_xor(4, 4, 0); //a^(a&1111)
		iterator++;assert(iterator<q);append_and(5, 1, 3); //b&1111
		iterator++;assert(iterator<q);append_or(0, 4, 5);
		//a^(a&1111)    |    b&1111
		iterator++;assert(iterator<q);append_right(99, 99, k);
	}
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 1 ms 1276 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 600 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

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

Subtask #6
0.0 / 29.0

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