| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 343088 | 2021-01-03T12:11:08 Z | IZhO_2021_I_want_Silver | "The Lyuboyn" code (IZhO19_lyuboyn) | C++14 | 0 ms | 0 KB |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <bitset>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// order_of_key (k) : Number of items strictly smaller than k .
// find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
//#define int ll
const int N = 2e5 + 5;
const int oo = 1e9 + 5;
int n, k, t;
string s;
bitset <N> was;
void show_bits(int x) {
for (int i = 0; i < n; ++i) {
if (x & (1 << i)) { cout << 1; }
else { cout << 0; }
}
cout << "\n";
}
int g(int x) {
return x ^ (x >> 1);
}
void solve() {
cin >> n >> k >> t;
cin >> s;
cout << (1 << n) <<"\n";
for (int i = 0; i < (1 << n); ++i) {
show_bits(g(i));
}
return;
int x = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '1') { x += (1 << i); }
}
was[x] = 1; show_bits(x);
int st_pos = 0;
for (int i = 1; i < (1 << n); ++i) {
while (was[x]) {
int pos = st_pos;
for (int cnt = 0; cnt < k; ++cnt) {
x ^= (1 << pos);
++pos; if (pos == n) { pos = 0; }
}
++st_pos; if (st_pos == n) { st_pos = 0; }
}
was[x] = 1; show_bits(x);
}
}
main () {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tests = 1;
//cin >> tests;
while (tests --) {
solve();
}
return 0;
}
/*
Just Chalish!
*/#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <bitset>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// order_of_key (k) : Number of items strictly smaller than k .
// find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
//#define int ll
const int N = 2e5 + 5;
const int oo = 1e9 + 5;
int n, k, t;
string s;
bitset <N> was;
void show_bits(int x) {
for (int i = 0; i < n; ++i) {
if (x & (1 << i)) { cout << 1; }
else { cout << 0; }
}
cout << "\n";
}
int g(int x) {
return x ^ (x >> 1);
}
void solve() {
cin >> n >> k >> t;
cin >> s;
if (k % 2 == 0) { cout << -1; return; }
cout << (1 << n) <<"\n";
for (int i = 0; i < (1 << n); ++i) {
show_bits(g(i));
}
return;
int x = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '1') { x += (1 << i); }
}
was[x] = 1; show_bits(x);
int st_pos = 0;
for (int i = 1; i < (1 << n); ++i) {
while (was[x]) {
int pos = st_pos;
for (int cnt = 0; cnt < k; ++cnt) {
x ^= (1 << pos);
++pos; if (pos == n) { pos = 0; }
}
++st_pos; if (st_pos == n) { st_pos = 0; }
}
was[x] = 1; show_bits(x);
}
}
main () {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tests = 1;
//cin >> tests;
while (tests --) {
solve();
}
return 0;
}
/*
Just Chalish!
*/