Submission #485442

#	Time	Username	Problem	Language	Result	Execution time	Memory
485442		maroonrk	Bit Shift Registers (IOI21_registers)	C++17	58 / 100	1 ms	460 KiB

registers

#include "registers.h"

#ifndef LOCAL
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#endif

#include <bits/stdc++.h>
using namespace std;

using ll=long long;
//#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

pi readpi(int off=0){
	int a,b;cin>>a>>b;
	return pi(a+off,b+off);
}

template<class t,class u>
void print(const pair<t,u>&p,int suc=1){
	print(p.a,2);
	print(p.b,suc);
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

template<class T>
void print_offset(const vector<T>&v,ll off,int suc=1){
	rep(i,v.size())
		print(v[i]+off,i==int(v.size())-1?suc:2);
}

template<class T,size_t N>
void print(const array<T,N>&v,int suc=1){
	rep(i,N)
		print(v[i],i==int(N)-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

vvc<int> readGraph(int n,int m){
	vvc<int> g(n);
	rep(i,m){
		int a,b;
		cin>>a>>b;
		//sc.read(a,b);
		a--;b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	return g;
}

vvc<int> readTree(int n){
	return readGraph(n,n-1);
}

const int M=100;
const int B=2000;
vi avail;

struct N{
	int idx;
	N(){
		assert(si(avail));
		idx=avail.back();
		avail.pop_back();
	}
	~N(){
		avail.pb(idx);
	}
};

using R=unique_ptr<N>;

R getregister(){
	return R(new N());
}

R getcopy(const R&x){
	R res=getregister();
	append_move(res->idx,x->idx);
	return res;
}

R getstored(const vc<bool>&d){
	assert(si(d)==B);
	R res=getregister();
	append_store(res->idx,d);
	return res;
}

R getand(const R&x,const R&y){
	R res=getregister();
	append_and(res->idx,x->idx,y->idx);
	return res;
}

R getor(const R&x,const R&y){
	R res=getregister();
	append_or(res->idx,x->idx,y->idx);
	return res;
}

R getxor(const R&x,const R&y){
	R res=getregister();
	append_xor(res->idx,x->idx,y->idx);
	return res;
}

R getnot(const R&x){
	R res=getregister();
	append_not(res->idx,x->idx);
	return res;
}

//i->i+v
R getshift(const R&x,int v){
	assert(inc(-B,v,B));
	R res=getregister();
	if(v<0){
		append_right(res->idx,x->idx,-v);
	}else{
		append_left(res->idx,x->idx,v);
	}
	return res;
}

R getadd(const R&x,const R&y){
	R res=getregister();
	append_add(res->idx,x->idx,y->idx);
	return res;
}

void construct_instructions(int ptype, int n, int k, int){
	per(i,M)avail.pb(i);
	R input=getregister();
	{
		int s=1;while(s<n)s*=2;
		s*=k;
		while(s>k){
			vc<bool> u(B);
			rep(i,B)if(i%s<s/2)u[i]=true;
			input=getand(getstored(u),getor(input,getshift(input,s/2)));
			s/=2;
		}
	}
	vc<bool> onebuf(B);onebuf[0]=true;
	R onereg=getstored(onebuf);
	auto work=[&](int step,vi ls){
		for(auto i:ls)assert(i+step<n);
		{
			vi tmp=ls;
			for(auto i:ls)tmp.pb(i+step);
			mkuni(tmp);
			assert(si(tmp)==si(ls)*2);
		}
		vc<bool> u(B);
		for(auto i:ls){
			rep(j,k){
				int x=i*(2*k)+j;
				u[x]=true;
			}
		}
		R m=getstored(u);
		R x=getand(m,input);
		R y=getand(m,getshift(input,-step*(2*k)));
		R dif=getadd(y,getadd(getnot(x),onereg));
		R z=getand(getxor(x,y),getshift(dif,-k));
		input=getxor(input,z);
		input=getxor(input,getshift(z,step*(2*k)));
	};
	if(ptype==0){
		for(int lv=0;(1<<lv)<n;lv++){
			vi ls;
			rep(i,n)if(i%(2<<lv)==0&&i+(1<<lv)<n){
				ls.pb(i);
			}
			work(1<<lv,ls);
		}
	}else{
		assert(0);
	}
	append_move(0,input->idx);
}

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 12 / 12
• Subtask 4: 25 / 25
• Subtask 5: 0 / 13
• Subtask 6: 0 / 29