#include "registers.h"
#include<bits/stdc++.h>
using namespace std;
const int B = 2000;
const int fi = 5 , se = 6;
const int full = 1 , one = 2 , mn = 3 , y = 4;
void construct_instructions(int s, int n, int k, int q)
{
vector<bool> v(2000);
for(int i = 0 ; i < k ;i++)
v[i] = 1;
append_store(full , v);
v.assign(2000 , 0);
v[0] = 1;
append_store(one , v);
append_and(mn , full , 0);
for(int i = 1 ; i < n ; i++)
{
append_right(y , 0 , i*k);
append_and(y , y , full);
// 4 : y
append_not(fi , y);
append_add(fi , fi , one);
append_add(fi , fi , mn);
// 5 : d>>(B - 1)
append_right(fi , fi , B - 1);
for(int i = 1 ;i < k ; i++)
{
append_left(se , fi , 1);
append_or(fi , fi , se);
}
append_xor(se , fi , full);
append_and(fi , fi , mn);
append_and(se , se , y);
append_or(mn , fi , se);
}
append_move(0 , mn);
}
# |
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 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
692 KB |
Output is correct |
3 |
Correct |
1 ms |
600 KB |
Output is correct |
4 |
Correct |
1 ms |
600 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Wrong answer detected in grader |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |