#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,ioi=b; i<ioi; i++)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define imp(v) {for(auto kdfhg:v)cout<<kdfhg<<" ";cout<<"\n";}
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
void append_move(int t, int x);
void append_store(int t, vector<bool> v);
void append_and(int t, int x, int y);
void append_or(int t, int x, int y);
void append_xor(int t, int x, int y);
void append_not(int t, int x);
void append_left(int t, int x, int s);
void append_right(int t, int x, int s);
void append_add(int t, int x, int y);
void append_print(int t);
const ll CACHE_SIZE=5;
const ll C=CACHE_SIZE,B=2000;
ll k;
vector<ll>c(C);
ll log2techo(ll n){
ll ret=63-__builtin_clzll(n);
if(__builtin_popcountll(n)>1)ret++;
return ret;
}
void expand(ll x){
fore(i,0,log2techo(k)){
ll q=1ll<<i;
if(2*q>k)q-=2*q-k;
append_left(c[0],x,q);
append_or(x,x,c[0]);
}
}
void my_xor_equal(ll x, ll y, ll f){ // x^=y if f
append_and(c[0],y,f);
append_xor(x,x,c[0]);
}
void my_assign(ll x, ll y, ll f){ // x:=y if f
expand(f);
// append_print(f);
// append_print(50);
append_xor(c[0],x,y);
append_and(c[0],c[0],f);
append_xor(x,x,c[0]);
}
ll first=0,n;
void ifmaysw(ll p){// of every k*p bits separated number
ll a=0,b=1;
append_right(b,a,k*p);
append_not(c[0],b);
append_or(c[0],c[0],a);
append_xor(c[1],a,b);
// append_print(a);
// append_print(b);
// append_print(c[0]);
// append_print(c[1]);
ll f0=c[3],f1=c[4];
vector<bool>v(B);
if(first++)append_store(f0,v);
fore(i,0,B)v[i]=!(i%(k*2*p));
append_store(f1,v);
// append_print(f1);
for(ll i=k-1;i>=0;i--){
ll pos=c[0];
if(i){
pos=c[2];
append_right(pos,c[0],i);
}
append_or(pos,f0,pos);
append_and(f1,f1,pos);
// append_print(pos);
pos=c[1];
if(i){
pos=c[2];
append_right(pos,c[1],i);
}
append_and(pos,f1,pos);
// append_print(pos);
append_or(f0,f0,pos);
// append_print(f0);
// append_print(f1);
}
// append_print(f0);
// append_print(f1);
my_assign(a,b,f1);
// append_print(0);
}
void construct_instructions(int s, int N, int K, int q){
assert(s|q|1);
n=N,k=K;
fore(i,0,C)c[i]=i+100-C;
vector<bool>v(B);
fore(i,n*k,B)v[i]=1;
if(n>2){
append_store(1,v);
append_or(0,0,1);
}
// append_print(0);
fore(i,0,n){
if((1ll<<i)>=n)break;
ifmaysw(1ll<<i);
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
600 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 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 |
Incorrect |
0 ms |
348 KB |
Incorrect sorting |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Incorrect sorting |
| 2 |
Halted |
0 ms |
0 KB |
- |
