이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#include "registers.h"
using namespace std;
constexpr int m = 100;
constexpr int b = 2000;
void construct_instructions(int s, int n, int k, int q) {
assert(s==0);
int used = 1;
int mask, ones;
vector<bool> maskv(b), onesv(b, 1);
for (int i = 0; i < n; i++)
maskv[k * (i+1) - k] = 1;
append_store(mask = used++, maskv);
append_store(ones = used++, onesv);
int ans = used++;
for (int bit = k-1; bit >= 0; bit--) {
int val, check, preserve_mask, curans;
append_and(val = used++, 0, mask);
append_not(val, val);
append_add(check = used++, val, ones);
append_right(curans = used++, check, b - 1);
append_left(curans, curans, bit);
append_or(ans, ans, curans);
append_right(check, check, b/2);
append_not(val, val);
append_and(preserve_mask = used++, mask, check);
append_or(mask, val, preserve_mask);
append_right(mask, mask, 1);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |