#include <bits/stdc++.h>
#include "registers.h"
using namespace std;
typedef long long ll;
vector<bool> num(ll num) {
vector<bool> res(2000);
for (int i = 0; i < 2000; i++) {
ll numBit = min(i, (int)(sizeof(ll)*4)-1);
res[i] = (num >> numBit) & 1;
}
return res;
}
void getMin(int x, int y) {
append_not(98, y);
append_add(98, 98, 99);
append_add(98, x, 98);
append_right(98, 98, 11);
append_and(x+20, x, 98);
append_and(y+40, y, 98);
append_not(98, 98);
append_and(y+20, y, 98);
append_and(x+40, x, 98);
append_or(x, x+20, y+20);
append_or(y, x+40, y+40);
}
void construct_instructions(int s, int n, int k, int q) {
append_store(99, num((1 << k) - 1));
for (int i = 0; i < n-1; i++) {
append_right(i+1, i, k);
append_and(i, i, 99);
}
for (int i = 0; i < n; i++) append_print(i);
append_store(99, num(1));
for (int j = 0; j < n; j++) {
for (int i = n-2; i >= 0; i--) {
getMin(i, i+1);
}
}
for (int i = 0; i < n; i++) append_print(i);
for (int i = n-1; i > 0; i--) {
append_left(i, i, k);
append_or(i-1, i-1, i);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Wrong answer detected in grader |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Wrong answer detected in grader |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Wrong answer detected in grader |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
604 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
604 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Incorrect |
0 ms |
344 KB |
Wrong answer detected in grader |
4 |
Halted |
0 ms |
0 KB |
- |