#include "registers.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "/home/ioi/contests/debug.h"
#else
#define debug(...) void(37)
#endif
constexpr int b = 2000;
void construct_instructions(int s, int n, int k, int q) {
if (s == 0 && n == 2 && k <= 2) {
vector<bool> n(b);
for (int i = 0; i < k; ++i) {
n[i] = true;
}
append_store(99, n);
append_move(1, 0);
append_right(1, 1, k);
append_and(0, 0, 99);
if (k != 1) {
append_xor(2, 0, 1);
append_and(3, 0, 2);
append_and(4, 1, 2);
append_right(3, 3, 1);
append_right(4, 4, 1);
append_or(0, 0, 3);
append_or(1, 1, 4);
append_and(0, 0, 1);
}
append_and(0, 0, 1);
append_and(0, 0, 99);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
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 |
344 KB |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
408 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 |
- |