#include "registers.h"
#include <bitset>
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
static const int m = 100;
static const int b = 2000;
void construct_instructions(int s,int n,int k,int q){
append_move(1, 0);
append_left(1,1,b-k);
append_right(1,1,b-k);
append_move(2,0);
append_right(2,2,k);
append_and(3,1,2);
vector<bool>sq;
for(int i=0;i<b;i++)
sq.push_back(false);
sq[1]=true;
append_store(4,sq);
sq[0]=true,sq[1]=false;
append_store(5,sq);
append_and(6,1,4);
append_and(7,1,5);
append_and(8,2,4);
append_and(9,2,5);
append_right(6,6,1);
append_xor(13,6,7);
append_left(6,6,1);
append_or(14,6,7);
append_move(15,13);
append_left(15,15,1);
append_add(15,15,13);
append_and(15,15,14);
append_right(8,8,1);
append_xor(16,8,9);
append_left(8,8,1);
append_or(17,8,9);
append_move(18,16);
append_left(18,18,1);
append_add(18,18,16);
append_and(18,18,17);
append_or(10,18,15);
append_move(11,10);
append_right(11,11,1);
append_and(11,10,11);
append_or(3,3,11);
append_move(0,3);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Wrong answer detected in grader |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |