제출 #355580

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
355580		kshitij_sodani	"The Lyuboyn" code (IZhO19_lyuboyn)	C++14	19 / 100	643 ms	57540 KiB

lyuboyn

//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'
int n,k,t;
vector<vector<int>> solve(int n){
	if(n==1){
		return {{0},{1}};
		return {{0,0},{0,1},{1,1},{1,0}};
	}
	else{
		vector<vector<int>> aa=solve(n-1);
		vector<vector<int>> bb=solve(n-1);
		reverse(bb.begin(),bb.end());
		for(int i=0;i<aa.size();i++){
			aa[i].pb(0);
			bb[i].pb(1);
		}
		for(int i=0;i<bb.size();i++){
			aa.pb(bb[i]);
		}
		return aa;
	}
}
int it[20];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n>>k>>t;
	string s;
	cin>>s;
	if(k%2==0){
		cout<<-1<<endl;
		return 0;
	}
	for(int i=0;i<n;i++){
		it[i]=s[i]-'0';
	}
	if(k==1 or k==n-1){
		vector<vector<int>> ans=solve(n);
		int ind=-1;
		int kk=0;
		if(k==n-1){
			kk=1;
		}
		for(int i=0;i<ans.size();i++){
			int st=1;
			for(int j=0;j<n;j++){
				if(ans[i][j]!=it[j]){
					st=0;
				}
			}
			if(st==1){
				ind=i;
			}
		}
		cout<<ans.size()<<endl;
	//	int cot=0;
		int cot=0;
		for(auto j:ans){
			for(int i=0;i<n;i++){
				if(cot==1 and kk==1){
					cout<<((it[i]^j[i])^1);
					continue;
				}
				cout<<(it[i]^j[i]);
			}
			cout<<endl;
			cot=1-cot;
		}
		/*for(int jj=ind;jj<ans.size();jj++){
			for(auto i:ans[jj]){
				cout<<(i);

			}
			cout<<endl;
			cot++;
		}
		for(int jj=0;jj<ind;jj++){
			for(auto i:ans[jj]){
				cout<<(i);
			}
			cout<<endl;
			cot++;
		}*/
	}
	else{
		cout<<-1<<endl;
		return 0;
		vector<vector<int>> ans=solve(k);
		vector<vector<int>> ans2=solve(n-k);
		for(int i=1;i<ans.size();i+=2){
			for(int j=0;j<k;j++){
				ans[i][j]^=1;
			}
		}
		int ind=0;
		int ind2=0;
		for(int i=0;i<(1<<n);i++){
			int coo=0;
			for(auto j:ans[ind]){
				cout<<(j^it[coo]);
				coo++;
			}
			for(auto j:ans2[ind2]){
				cout<<(j^it[coo]);
				coo++;
			}
			cout<<endl;
			ind++;
			ind2++;
			if(ind==ans.size()){
				ind=0;
			}
			if(ind2==ans2.size()){
				ind2=0;
			}
		}

	}
	
 
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

lyuboyn.cpp: In function 'std::vector<std::vector<int> > solve(int)':
lyuboyn.cpp:20:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |   for(int i=0;i<aa.size();i++){
      |               ~^~~~~~~~~~
lyuboyn.cpp:24:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |   for(int i=0;i<bb.size();i++){
      |               ~^~~~~~~~~~
lyuboyn.cpp: In function 'int main()':
lyuboyn.cpp:51:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |   for(int i=0;i<ans.size();i++){
      |               ~^~~~~~~~~~~
lyuboyn.cpp:46:7: warning: variable 'ind' set but not used [-Wunused-but-set-variable]
   46 |   int ind=-1;
      |       ^~~
lyuboyn.cpp:97:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |   for(int i=1;i<ans.size();i+=2){
      |               ~^~~~~~~~~~~
lyuboyn.cpp:117:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |    if(ind==ans.size()){
      |       ~~~^~~~~~~~~~~~
lyuboyn.cpp:120:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |    if(ind2==ans2.size()){
      |       ~~~~^~~~~~~~~~~~~

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