Submission #438375

# Submission time Handle Problem Language Result Execution time Memory
438375 2021-06-27T21:50:08 Z Ozy Bit Shift Registers (IOI21_registers) C++17
21 / 100
1 ms 204 KB
#include "registers.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define lli long long int
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "

#define append_print(x) //hoja

vector<bool> borra;

void construct_instructions(int s, int n, int k, int q) {

    borra.resize(2000,false);


    if (k == 2) {
        borra[1] = true;
        append_right(1,0,1);
        append_not(2,1);
        append_and(3,2,0);
        append_move(4,3);
        append_right(4,4,2);
        append_or(5,4,3);

        append_right(6,0,2);
        append_and(7,0,6);

        append_xor(8,0,6);
        append_right(9,8,1);
        append_not(10,9);

        append_and(11,9,5);
        append_and(12,10,7);

        append_store(13, borra);
        append_and(0,7,13);

        append_right(13,13,1);
        append_or(14,11,12);
        append_and(14,14,13);
        append_or(0,0,14);
    }
    else if (k == 1){
  rep(i,0,k-1) borra[i] = true;
    append_right(2,0,k);

    append_store(17,borra);
    append_and(1,0,17);
    append_right(17,17,1);
        append_and(0,2,1);
        return;
    }

}

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Incorrect min value
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Incorrect min value
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Incorrect sorting
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Incorrect sorting
2 Halted 0 ms 0 KB -