#include "registers.h"
#include <bits/stdc++.h>
using namespace std;
void construct_instructions(int s, int n, int k, int q) {
const int b = 2000;
//Subtask group 1: 21 points
if(k == 1) {
append_right(1, 0, 1);
vector<bool> oh(b);
oh[0] = 1;
append_store(2, oh);
append_and(0, 0, 2);
append_and(0, 0, 1);
return;
}
if(k == 2) {
append_right(1, 0, 2);
vector<bool> oh(b);
oh[0] = oh[1] = 1;
append_store(2, oh);
append_and(0, 0, 2);
for(int i=0; i<3; i++) {
append_move(2, 1);
for(int j=0; j<k; j++) {
int tar = (i == 2 && j == k-1 ? 0 : 2);
append_add(tar, 0, 2);
append_right(tar, tar, 1);
}
if(i < 2) append_move(0, 2);
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
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 |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
272 KB |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
292 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
292 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |