이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "registers.h"
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#define ff first
#define ss second
typedef long long ll;
using namespace std;
void construct_instructions(int s, int n, int k, int q) {
if (k == 1) {
append_move(1, 0);
append_right(1, 1, 1);
append_and(0, 0, 1);
return;
}
vector <bool> b(2000, 0);
b[0] = 1;
append_store(1, b);
append_and(2, 0, 1);
b[0] = 0;
b[1] = 1;
append_store(3, b);
append_and(4, 0, 3);
b[1] = 0;
b[2] = 1;
append_store(5, b);
append_and(6, 0, 5);
b[2] = 0;
b[3] = 1;
append_store(7, b);
append_and(8, 0, 7);
append_and(9, 4, 8);
append_not(10, 9);
append_xor(11, 4, 10);
append_xor(12, 8, 10);
append_xor(13, 1, 2);
append_xor(14, 1, 6);
append_and(15, 13, 11);
append_and(16, 14, 12);
append_or(17, 15, 16);
append_xor(18, 17, 1);
append_right(19, 9, 1);
append_add(0, 19, 18);
}
# | 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... |