#include "registers.h"
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<vvpii> vvvpii;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
void construct_instructions(int s, int n, int k, int q)
{
if (n == 2)
{
vb mask;
mask.assign(2000, 0);
for (int i = 0; i < k; ++i)
mask[i] = 1;
append_store(99, mask);
mask.assign(2000, 0);
mask[0] = 1;
append_store(98, mask);
// append_print(0);
append_and(1, 0, 99); // x in 1
append_right(0, 0, k); // y in 0
append_print(0);
append_print(1);
append_not(2, 1); // ~x
append_add(2, 2, 98); // -x
append_add(2, 0, 2); // y - x in 2
append_print(2);
append_right(3, 2, k);
append_and(3, 2, 3);
append_add(0, 1, 3);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
304 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
304 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |