#include "registers.h"
using namespace std;
using lint = long long;
using pi = pair<int, int>;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
void construct_instructions(int s, int n, int k, int q) {
{
vector<bool> vect(2000);
fill(vect.begin(), vect.begin() + k, 1);
append_store(99, vect);
append_store(98, vect);
fill(all(vect), 0);
vect[0] = 1;
append_store(97, vect);
}
for(int i = 0; i < n; i++){
// 1 vs 99
append_right(1, 0, i * k);
append_and(1, 1, 98);
append_xor(2, 1, 99);
append_not(3, 99);
append_add(3, 3, 97);
append_add(3, 3, 1);
append_right(3, 3, 1000);
append_and(2, 2, 3);
append_xor(99, 99, 2);
}
append_right(0, 99, 0);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Wrong answer detected in grader |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Wrong answer detected in grader |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |