# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
343243 | IZhO_2021_I_want_Silver | "The Lyuboyn" code (IZhO19_lyuboyn) | C++14 | 291 ms | 23144 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <bitset>
#include <vector>
using namespace std;
#define sz(a) (int)a.size()
#define pb push_back
#define ppb pop_back
const int N = 3e5 + 5;
int n, k, t;
string s;
bitset <N> was;
vector <int> vec, good;
void show_bits(int x) {
for (int i = 0; i < n; ++i) {
if (x & (1 << i)) { cout << 1; }
else { cout << 0; }
}
cout << "\n";
}
void go(int pos) {
if (pos == (1 << n) + 1) {
if (t == 1) {
if (__builtin_popcount(vec[0] ^ vec.back()) == k) {
cout << sz(vec) <<"\n";
for (int i = 0; i < sz(vec); ++i) {
show_bits(vec[i]);
}
exit(0);
}
}
else {
cout << sz(vec) <<"\n";
for (int i = 0; i < sz(vec); ++i) {
show_bits(vec[i]);
}
exit(0);
}
return;
}
for (int i = 0; i < sz(good); ++i) {
int x = (vec.back() ^ good[i]);
if (was[x]) { continue; }
//if (__builtin_popcount((vec.back() ^ x)) != k) { continue; }
was[x] = 1;
vec.pb(x);
go(pos + 1);
was[x] = 0;
vec.ppb();
}
}
void solve() {
cin >> n >> k >> t;
cin >> s;
if (k % 2 == 0) { cout << -1; return; }
for (int i = 0; i < (1 << n); ++i) {
if (__builtin_popcount(i) == k) { good.pb(i); }
}
int x = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '1') { x += (1 << i); }
}
was[x] = 1;
vec.pb(x);
go(2);
was[x] = 0;
vec.ppb();
return;
}
main () {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tests = 1;
//cin >> tests;
while (tests --) {
solve();
}
return 0;
}
/*
Ускоренный перебор правильного порядка
* может быстро и легко находится подходящий?
* max размер vector good -> 48000
* по сути это ускоренный слоу
* вместо того чтобы перебирать (1 << n) = 2 * 10^5 элементов и проверять биты,
* мы делаем массив good где все гаходим легко подходящий по битам
и проверяем не более 48000 элементов
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |