oj.uz

Submission #1056915

# Submission time Handle Problem Language Result Execution time Memory
1056915 2024-08-13T12:22:29 Z user736482 Bit Shift Registers (IOI21_registers) C++17
46 / 100
 1 ms 764 KB 
#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);
    }
}

Compilation message

registers.cpp: In function 'void construct_instructions(int, int, int, int)':
registers.cpp:85:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   85 |         if(i>0)
      |         ^~
registers.cpp:87:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   87 |             append_and(i,99,i);
      |             ^~~~~~~~~~

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 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 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
13.0 / 13.0

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

Subtask #6
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 764 KB Wrong answer detected in grader
4 Halted 0 ms 0 KB -