제출 #911196

#제출 시각아이디문제언어결과실행 시간메모리
911196daoquanglinh2007"The Lyuboyn" code (IZhO19_lyuboyn)C++17
83 / 100
206 ms8840 KiB
#include <bits/stdc++.h> using namespace std; #define flipbit(x, i) x ^= (1<<(i)) const int a[] = {0, 7, 9, 2, 5, 8, 3, 4, 10, 1, 6, 11, 12, 16, 23, 13, 17, 22, 15, 19, 20, 14, 18, 21, 24, 31, 39, 32, 43, 25, 30, 38, 33, 42, 27, 28, 36, 35, 40, 26, 29, 37, 34, 41, 46, 50, 53, 44, 48, 55, 45, 49, 54, 59, 60, 47, 57, 62, 51, 61, 58, 52, 63, 56}; const int b[] = {0, 1, 3, 2, 6, 7, 5, 4}; string bS; int N, K, S, T; vector <int> v, ans; int cnt[262144]; vector <int> build(int N){ if (N == 1){ vector <int> ans = {0, 1}; return ans; } vector <int> a = build(N-1); for (int i = 0; i < (1<<(N-1)); i++){ a.push_back((1<<(N-1))+a[(1<<(N-1))-1-i]); } return a; } void show(int x){ for (int i = N-1; i >= 0; i--) cout << ((x>>i)&1); cout << endl; } vector <int> build3(int N){ if (N == 6){ vector <int> ans(0); for (int i = 0; i < 64; i++) ans.push_back(a[i]); return ans; } vector <int> tmp = build3(N-3), ans = tmp; for (int i = 1; i < 8; i++){ int x = ans.back()&((1<<(N-3))-1); x ^= (1<<(N-4))+(1<<(N-5)); for (int j = 0; j < (1<<(N-3)); j++) ans.push_back((b[i]<<(N-3))+(x^tmp[j])); } return ans; } int main(){ // freopen("LYUBOYN.inp", "r", stdin); // freopen("LYUBOYN.out", "w", stdout); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N >> K >> T >> bS; for (int i = 0; i < N; i++) if (bS[i] == '1') S += (1<<(N-1-i)); v = build(N); ans.clear(); ans.push_back(S); for (int i = 1; i < (1<<N); i++){ ans.push_back(ans[i-1]); for (int j = 0; j < N; j++) if (((v[i]^v[i-1])>>j)&1){ for (int t = 0; t < K; t++) flipbit(ans[i], (j+t)%N); } } bool ok = 1; for (int x : ans){ if (cnt[x]){ ok = 0; break; } cnt[x]++; } if (ok){ cout << (1<<N) << '\n'; for (int x : ans){ for (int i = N-1; i >= 0; i--) cout << ((x>>i)&1); cout << '\n'; } return 0; } if (K != 3 || N == 3){ if (K == 7){ cout << "MMB" << endl; } cout << "-1\n"; return 0; } ans = build3(N); cout << (1<<N) << '\n'; for (int &x : ans){ x ^= S; for (int i = N-1; i >= 0; i--) cout << ((x>>i)&1); cout << '\n'; } return 0; }
#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...