#include "registers.h"
#include <bits/stdc++.h>
using namespace std;
void construct_instructions(int s, int n, int k, int q) {
vector<bool> v(2000, 0);
for (int i = 0; i < k; i++) v[i] = 1;
append_store(6, v);
append_move(1, 0);
append_and(1, 1, 6);
append_right(0, 0, k);
for (int i = 1; i < n; i++)
{
append_move(2, 0);
append_and(2, 2, 6);
append_xor(3, 1, 2);
for (int j = 1; j < k; j <<= 1)
{
append_right(4, 3, j);
append_or(3, 3, 4);
}
append_right(4, 3, 1);
append_xor(3, 3, 4);
append_and(4, 1, 3);
for (int j = 1; j < k; j <<= 1)
{
append_right(5, 4, j);
append_or(4, 4, 5);
}
append_or(1, 1, 4);
append_and(4, 2, 3);
for (int j = 1; j < k; j <<= 1)
{
append_right(5, 4, j);
append_or(4, 4, 5);
}
append_or(2, 2, 4);
append_and(1, 1, 2);
append_right(0, 0, k);
}
append_move(0, 1);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Wrong answer detected in grader |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
596 KB |
Output is correct |
2 |
Correct |
1 ms |
764 KB |
Output is correct |
3 |
Correct |
1 ms |
600 KB |
Output is correct |
4 |
Correct |
1 ms |
764 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Wrong answer detected in grader |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |