Submission #1174328

#	Time	Username	Problem	Language	Result	Execution time	Memory
1174328		PagodePaiva	Bit Shift Registers (IOI21_registers)	C++20	0 / 100	0 ms	328 KiB

registers

#include "registers.h"
#include <bits/stdc++.h>

using namespace std;

/*
void append_move(int t, int y)
void append_store(int t, 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 p)
void append_right(int t, int x, int p)
void append_add(int t, int x, int y)*/

const int b = 2000;
vector <bool> v;

void construct_instructions(int s, int n, int k, int q) {
    for(int i = 0;i < b;i++){
        v.push_back(false);
    }
    append_move(1, 0);
    append_right(1, 1, k);
    if(k == 1){
        append_or(0, 0, 1);
    }
    else{
        append_or(2, 0, 1);
        v[1] = true;
        append_store(3, v);
        append_and(2, 1, 2);
        append_xor(3, 0, 2);
        append_xor(4, 1, 2);
        append_not(3, 3);
        append_not(4, 4);
        append_right(3, 3, 1);
        append_right(4, 4, 1);
        append_and(5, 3, 0);
        append_and(6, 4, 1);
        append_or(7, 6, 5);
        v[1] = false;
        v[0] = true;
        append_store(8, v);
        append_and(7, 7, 8);
        append_or(2, 7, 2);
        append_move(0, 2);
    }
}

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