Submission #1132325

#TimeUsernameProblemLanguageResultExecution timeMemory
1132325stdfloat"The Lyuboyn" code (IZhO19_lyuboyn)C++20
5 / 100
1095 ms3176 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int n, k, t, z; vector<int> v; 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 (int i = 0; i < z; i++) { if (vis[i] || __builtin_popcount(v.back() ^ i) != k) continue; vis[i] = true; v.push_back(i); f(x + 1); v.pop_back(); vis[i] = false; } } 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); f(1); cout << -1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...