제출 #1132346

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1132346		stdfloat	"The Lyuboyn" code (IZhO19_lyuboyn)	C++20	97 / 100	1096 ms	27212 KiB

lyuboyn

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

int n, k, t, z;

vector<int> v, u;

vector<bool> vis;

void f(int x) {
	if (x == z) {
		if (t == 1 && __builtin_popcount(v[0] ^ v[z - 1]) != k) return;

		cout << z << '\n';
		for (auto i : v) {
			for (int j = n - 1; j >= 0; j--)
				cout << ((i >> j) & 1);
			cout << '\n';
		}

		exit(false);
	}

	for (auto i : u) {
		if (vis[v.back() ^ i]) continue;

		vis[v.back() ^ i] = true;
		v.push_back(v.back() ^ i);

		f(x + 1);

		vis[v.back() ^ i] = false;
		v.pop_back();
	}
}

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

	string s;
	cin >> n >> k >> t >> s;

	int x = 0;
	for (int i = 0; i < n; i++)
		x += (1 << (n - i - 1)) * (s[i] - '0');

	z = 1 << n;
	vis.assign(z, false);
	
	vis[x] = true;
	v.push_back(x);

	for (int i = 0; i < z; i++)
		if (__builtin_popcount(i) == k) u.push_back(i);

	f(1);

	cout << -1;
}

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