#include "registers.h"
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
void construct_instructions(int s, int n, int k, int q) {
int b=2000;
if(k==1){
append_move(1, 0);
append_right(1, 1, 1);
append_and(0, 0, 1);
return;
}
append_move(1,0);
append_right(1,1,2);
append_left(0,0,b-2);
append_right(0,0,b-2);
append_right(2,0,1);
append_right(3,1,1);
append_and(4,3,2); // and at index 1
append_not(5,2);
append_not(6,3);
append_or(7,4,5);
append_or(8,4,6);
append_not(9,0);
append_not(10,1);
append_and(11,9,7);
append_and(12,10,8);
append_or(13,11,12);
append_not(13,13);
append_left(4,4,1);
append_or(0,13,4);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |