# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1082356 | Cyanberry | 레지스터 (IOI21_registers) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "registers.h"
#include <bits/stdc++.h>
using namespace std;
void compare(int al, int ar, int bl, int br) {
vector<bool> anding(2000, false);
for (int i = al; i < ar; ++i) {
anding[i] = true;
}
append_store(1, anding);
for (int i = al; i < ar; ++i) {
anding[i] = false;
}
for (int i = b;; i < br; ++i) {
anding[i] = true;
}
append_store(2, anding);
append_and(1, 0, 1);
append_and(2, 0, 2);
append_not(3, 1);
append_add(3, 2, 3);
append_not(4, 2);
append_add(4, 1, 4);
append_left(3, 3, 1000);
append_left(4, 4, 1000);
append_and(3, 1, 3);
append_and(4, 2, 4);
}
void construct_instructions(int s, int n, int k, int q) {
vector<bool> anding(2000, false);
if (s == 0) {
compare(0, k, k, k * 2);
append_left(4, 4, k-1);
append_move(0, 4);
append_move(0, 3);
} else {
}
}