Submission #339464

#	Time	Username	Problem	Language	Result	Execution time	Memory
339464		mosiashvililuka	"The Lyuboyn" code (IZhO19_lyuboyn)	C++14	100 / 100	651 ms	7660 KiB

lyuboyn

#include<bits/stdc++.h>
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,n,k,T,p[1000009],pi,q[1000009],qi,z,x,y;
string ss;
string totwo(int q){
	//cout<<q<<" l"<<endl;
	string s;
	for(int h=n-1; h>=0; h--){
		if(((1<<h)&q)!=0) s.push_back('1'); else s.push_back('0');
	}
	return s;
}
int main(){
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>n>>k>>T>>ss;
	if(k%2==0){
		cout<<-1;
		return 0;
	}
	if(k>=n){
		cout<<-1;
		return 0;
	}
	pi=4;
	p[1]=0;p[2]=1;p[3]=3;p[4]=2;
	for(i=4; i<=k+1; i+=2){
		qi=0;
		y=(1<<(i-2))-1;z=(1<<(i-1));x=(1<<(i-2));
		for(j=1; j<=pi; j++){
			qi++;q[qi]=p[j];
			if(j%2==0){
				q[qi]^=z;q[qi]^=x;
			}
		}
		c=(p[pi]^y);
		for(j=1; j<=pi; j++){
			qi++;q[qi]=p[j];q[qi]^=c;
			if(j%2==1){
				q[qi]^=x;
			}else{
				q[qi]^=z;
			}
		}
		for(j=1; j<=pi; j++){
			qi++;q[qi]=p[j];
			if(j%2==1){
				q[qi]^=z;q[qi]^=x;
			}
		}
		for(j=1; j<=pi; j++){
			qi++;q[qi]=p[j];q[qi]^=c;
			if(j%2==1){
				q[qi]^=z;
			}else{
				q[qi]^=x;
			}
		}
		pi=qi;
		for(j=1; j<=pi; j++) p[j]=q[j];
	}
	for(i=k+2; i<=n; i++){
		qi=0;y=(1<<(k-1))-1;z=(1<<(i-1));
		for(j=1; j<=pi; j++){
			qi++;q[qi]=p[j];
		}
		y^=q[qi];
		for(j=1; j<=pi; j++){
			qi++;q[qi]=p[j];q[qi]^=y;q[qi]^=z;
		}
		pi=qi;
		for(j=1; j<=pi; j++) p[j]=q[j];
	}
	c=0;
	for(i=0; i<n; i++) if(ss[i]=='1') c+=(1<<(n-i-1));
	for(i=1; i<=pi; i++) p[i]^=c;
	cout<<pi<<endl;
	for(i=1; i<=pi; i++){
		cout<<totwo(p[i])<<endl;
	}
	return 0;
}

• Subtask 1: 0 / 0
• Subtask 2: 5 / 5
• Subtask 3: 3 / 3
• Subtask 4: 11 / 11
• Subtask 5: 15 / 15
• Subtask 6: 18 / 18
• Subtask 7: 31 / 31
• Subtask 8: 17 / 17