#include <bits/stdc++.h>
using namespace std;
#include "registers.h"
#define pb push_back
//append_move
//append_store
//append_and
//append_or
//append_xor
//append_not
//append_left
//append_right
//append_add
void construct_instructions(int s, int n, int k, int q) {
if(k==1){
append_move(1,0);
append_right(1,1,1);
append_and(0,0,1);
return;
}
vector<bool> v[4];
for (int i = 0; i < 4; ++i)
{
for (int j = 0; j < 2000; ++j)
{
if(i==j) v[i].pb(1);
else v[i].pb(0);
}
}
append_store(1,v[0]);
append_store(2,v[1]);
append_store(3,v[2]);
append_store(4,v[3]);
append_and(5,0,1);
append_and(6,0,2);
append_and(7,0,3);
append_and(8,0,4);
append_right(6,6,1);
append_right(7,7,2);
append_right(8,8,3);
append_and(9,5,7);
append_and(10,6,8);
append_xor(11,5,7);
append_xor(12,6,8);
append_and(13,11,12);
append_xor(14,13,9);
append_left(10,10,1);
append_add(0,10,14);
//append_print(0);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
436 KB |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 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 min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |