#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
/*
read the solution a long time ago, remember some key ideas from there
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "registers.h"
void construct_instructions(int s, int n, int k, int q) {
if(s == 0 and n <= 2){
const int b = 2000;
int x = 0;
int y = 51;
int minus_one = 90;
vector<bool> all_set(b,1);
append_store(minus_one,all_set);
int one = 91;
vector<bool> one_set(b);
one_set[0] = 1;
append_store(one,one_set);
rep1(i,n-1){
vector<bool> filter(b);
for(int j = i*k; j < (i+1)*k; ++j){
filter[j] = 1;
}
append_store(y,filter);
append_and(y,y,0);
append_right(y,y,i*k);
fill(all(filter),0);
for(int j = 0; j < k; ++j){
filter[j] = 1;
}
int z = 60;
append_store(z,filter);
append_and(x,x,z);
int xnot = 52, ynot = 53;
append_not(xnot,x);
append_not(ynot,y);
int x_minus_y = 54, y_minus_x = 55;
append_add(x_minus_y,x,ynot);
append_add(y_minus_x,y,xnot);
append_add(x_minus_y,x_minus_y,one);
append_right(x_minus_y,x_minus_y,b-1);
append_right(y_minus_x,y_minus_x,b-1);
append_add(x_minus_y,x_minus_y,minus_one);
append_add(y_minus_x,y_minus_x,minus_one);
int x_contrib = 56, y_contrib = 57;
append_and(x_contrib,x,y_minus_x);
append_and(y_contrib,y,x_minus_y);
append_or(x,x_contrib,y_contrib);
}
return;
}
const int b = 2000;
int minus_one = 90;
vector<bool> all_set(b,1);
append_store(minus_one,all_set);
int one = 91;
vector<bool> one_set(b);
one_set[0] = 1;
append_store(one,one_set);
auto append_min = [&](int t, int x, int y){
// puts min(x,y) into t
int xnot = 52, ynot = 53;
append_not(xnot,x);
append_not(ynot,y);
int x_minus_y = 54, y_minus_x = 55;
append_add(x_minus_y,x,ynot);
append_add(y_minus_x,y,xnot);
append_add(x_minus_y,x_minus_y,one);
append_right(x_minus_y,x_minus_y,b-1);
append_right(y_minus_x,y_minus_x,b-1);
append_add(x_minus_y,x_minus_y,minus_one);
append_add(y_minus_x,y_minus_x,minus_one);
int x_contrib = 57, y_contrib = 58;
append_and(x_contrib,x,y_minus_x);
append_and(y_contrib,y,x_minus_y);
append_or(t,x_contrib,y_contrib);
};
auto append_min_max = [&](int x, int y){
// x < y
// puts min(x,y) into x, max(x,y) into y
int z = 59;
append_min(z,x,y);
int xo = 60;
append_xor(xo,x,y);
append_xor(y,xo,z);
append_move(x,z);
};
if(s == 0){
int x = 50;
int y = 51;
rep(i,n){
vector<bool> filter(b);
for(int j = i*k; j < (i+1)*k; ++j){
filter[j] = 1;
}
append_store(y,filter);
append_and(y,y,0);
append_right(y,y,i*k);
if(i == 0){
append_move(x,y);
conts;
}
append_min(x,x,y);
}
append_move(0,x);
return;
}
rep(i,n){
vector<bool> filter(b);
for(int j = i*k; j < (i+1)*k; ++j){
filter[j] = 1;
}
append_store(i+1,filter);
append_and(i+1,i+1,0);
append_right(i+1,i+1,i*k);
}
rep1(iter,n){
rev(i,n,2){
append_min_max(i-1,i);
}
}
vector<bool> zero(b);
append_store(0,zero);
rep1(i,n){
append_left(i,i,(i-1)*k);
append_or(0,0,i);
}
}
| # |
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 |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
2 ms |
688 KB |
Output is correct |
| 3 |
Correct |
1 ms |
604 KB |
Output is correct |
| 4 |
Correct |
2 ms |
604 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 |
Correct |
2 ms |
600 KB |
Output is correct |
| 2 |
Correct |
1 ms |
604 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
600 KB |
Output is correct |
| 2 |
Correct |
1 ms |
604 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
348 KB |
Wrong answer detected in grader |
| 4 |
Halted |
0 ms |
0 KB |
- |
