Submission #181145

#	Time	Username	Problem	Language	Result	Execution time	Memory
181145		BThero	"The Lyuboyn" code (IZhO19_lyuboyn)	C++17	100 / 100	771 ms	23580 KiB

lyuboyn

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x).size()
#define S second
#define F first
#define all(x) (x).begin(), (x).end()


using namespace std;

const bool dbg_flg = 1;
#define debug(x) if (dbg_flg) cerr << #x << ' ' << x << '\n'
#define debug_pair(x) if (dbg_flg) cerr << #x << ' ' << x.F << ' ' << x.S << '\n'
 
const int inf = 1e9 + 7;
const int MAXN = (1 << 18) + 5;

vector<int> V;

int n, k, t;

string st;

int arr[MAXN];

bool used[MAXN];

int f(int a, int b) {
	return __builtin_popcount(a ^ b);
}

string str(int x) {
	string ret;

	while (x > 0) {
		ret.pb(x % 2 + '0');
		x /= 2;
	}

	while (ret.size() < n) {
		ret.pb('0');
	}

	reverse(ret.begin(), ret.end());
	return ret;
}

void printAns() {
	cout << (1 << n) << endl;

	for (int i = 0; i < (1 << n); ++i) {
		cout << str(arr[i]) << endl;
	}

	exit(0);
}

void rec(int v) {
	if (v == (1 << n) - 1) {
		if (t == 1) {
			if (f(arr[v], arr[0]) == k) {
				printAns();				
			}			
		}
		else {
			printAns();
		}

        return;             
	}

	for (int y : V) {
		int x = (arr[v] ^ y);

		if (!used[x] && f(arr[v], x) == k) {
			used[x] = 1;
			arr[v + 1] = x;
			rec(v + 1);
			used[x] = 0;
		}
	}
}

int bin(string s) {
	reverse(all(s));
	int ret = 0;

	for (int i = 0; i < s.size(); ++i) {
		if (s[i] == '1') {
			ret += (1 << i);
		}
	}

	return ret;
}

int main() {
	
	//~ freopen(".in", "r", stdin);
	//~ freopen(".out", "w", stdout);
	
	ios_base::sync_with_stdio(NULL);
	cin.tie(NULL);
	cout.tie(NULL);

	cin >> n >> k >> t;
	cin >> st;

	if (k % 2 == 0) {
		cout << -1 << endl;
		return 0;
	}

	for (int i = 0; i < (1 << n); ++i) {
		if (__builtin_popcount(i) == k) {
			V.pb(i);
		}
	}

	arr[0] = bin(st);
	used[bin(st)] = 1;    
	rec(0);
	return 0;
}

Compilation message (stderr)

lyuboyn.cpp: In function 'std::__cxx11::string str(int)':
lyuboyn.cpp:42:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (ret.size() < n) {
         ~~~~~~~~~~~^~~
lyuboyn.cpp: In function 'int bin(std::__cxx11::string)':
lyuboyn.cpp:90:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < s.size(); ++i) {
                  ~~^~~~~~~~~~

• 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