#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 1000010, MAX_W = 30, inf = 1e7;
int cal(int v, int wid) {
int dp[2] {};
for (int i = 0;i < wid;++i) {
int a = v>>i&1;
int tmp[2] {};
tmp[a^1] = dp[a^1];
tmp[a] = dp[0] + 1 + dp[1];
swap(dp, tmp);
chmin(dp[0], inf), chmin(dp[1], inf);
}
return dp[0] + dp[1];
}
int cnt[MAX_N];
int rec[MAX_N];
void solve() {
int K;
cin >> K;
for (int wid = 1;;++wid) {
for (int i = 0;i < 1<<wid;++i) {
rec[i] = cal(i, wid);
++cnt[ rec[i] ];
}
if (cnt[K]) {
cout << cnt[K] << '\n';
for (int i = 0;i < 1<<wid;++i) {
if (rec[i] == K) {
for (int j = 0;j < wid;++j)
cout << (i>>j&1) << " \n"[j+1==wid];
break;
}
}
}
bool ok = cnt[K];
for (int i = 0;i < 1<<wid;++i)
--cnt[ rec[i] ];
if (ok) break;
}
}
int32_t main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int T;
cin >> T;
while (T--) solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1076 ms |
532 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
719 ms |
16224 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
425 ms |
16260 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |