# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1056913 | user736482 | Bit Shift Registers (IOI21_registers) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include "registers.h"
#include "grader.cpp"
using namespace std;
vector<bool>zera,jeden4;
void minimum(int a,int b,int t){
//append_store(t,zera);
// append_move(98,a);
append_not(98,a);
append_add(98,b,98);
append_right(98,98,10);
append_and(t,b,98);
append_not(98,98);
append_and(98,a,98);
append_add(t,98,t);
/*zera[0]=1;
append_store(98,zera);
zera[0]=0;
append_add(98,b,98);
append_not(98);
append_add(98,a,98);
append_left(98,10,98);
append_and(t,b,98);*/
}
void minimax(int a,int b,int t1,int t2){
//append_store(t,zera);
// append_move(98,a);
append_not(98,a);
append_add(98,b,98);
append_right(98,98,10);
append_and(t1,b,98);
append_and(t2,a,98);
append_not(98,98);
append_and(97,b,98);
append_and(98,a,98);
append_add(t1,98,t1);
append_add(t2,97,t2);
/*zera[0]=1;
append_store(98,zera);
zera[0]=0;
append_add(98,b,98);
append_not(98);
append_add(98,a,98);
append_left(98,10,98);
append_and(t,b,98);*/
}
void construct_instructions(int s, int n, int k, int q){
for(int i=0;i<2000;i++){
zera.push_back(0);
jeden4.push_back(0);
if(i<k)
jeden4[i]=1;
}
append_and(1,99,1);
//append_right(0,k,0);
//append_move(1,0);
append_store(99,jeden4);
if(s==0){
append_right(1,0,(n-1)*k);
for(int i=n-2;i>=0;i--){
append_right(2,0,i*k);
append_and(2,99,2);
minimum(1,2,3);
append_move(1,3);
}
//minimum(0,1,3);
append_move(0,1);}
else{
for(int i=n-1;i>=0;i--){
append_print(0);
append_print(1);
if(i>0)
append_right(i,0,i*k);
append_and(i,99,i);
}
append_print(0);
append_print(1);
for(int i=0;i<n-1;i++){
for(int j=0;j<n-1;j++){
minimax(j,j+1,95,96);
append_move(j,95);
append_move(j+1,96);
}
}
for(int i=n-1;i>0;i--){
append_print(0);
append_print(1);
//if(i>0)
append_left(i,i ,i*k);
append_add(0,0,i);
}
append_print(0);
append_print(1);
}
}