Submission #1186989

#	Time	Username	Problem	Language	Result	Execution time	Memory
1186989		PieArmy	"The Lyuboyn" code (IZhO19_lyuboyn)	C++20	36 / 100	222 ms	7592 KiB

lyuboyn

#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define fr first
#define sc second
#define endl '\n'
using namespace std;

int n,k,t;
int s;
vector<int>ans;
int var[1<<18];

void yaz(){
	int x=ans.back()^s;
	//if(var[x])assert(0);
	var[x]=1;
	for(int i=0;i<n;i++){
		cout<<!!(x&(1<<i));
	}
	cout<<endl;
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);
	//freopen("tc.out","w",stdout);
	//freopen("tc.in","r",stdin);
	cin>>n>>k>>t;
	for(int i=0;i<n;i++){
		char c;cin>>c;
		if(c=='1'){
			s+=(1<<i);
		}
	}
	if(n<=k||(k&1)==0){
		cout<<-1;
		return 0;
	}
	cout<<(1<<n)<<endl;
	ans.pb(0);
	yaz();
	int cur=(1<<k)-1+(k!=3?(1<<(k-1)):0);
	for(int i=0;i<n;i++){
		for(int j=ans.size()-1;j>=0;j--){
			ans.pb(ans[j]^cur);
			yaz();
		}
		cur=(cur>>1)|((cur&1)<<(n-1));
	}
}

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