提出 #70489493

---

ソースコード 拡げる

#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = std::forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = std::forward<U>(y), true); }

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using namespace std;

using ll = long long;

void solve() {
    int N, K;
    cin >> N >> K;

    vector<int> ans(1 << N);
    auto dfs = [&](auto self, int l, int r, int sum) -> void {
        if (r - l == 1) {
            ans[l] = sum;
            return;
        }
        int m = (l + r) >> 1;
        self(self, l, m, (sum + 1) / 2);
        self(self, m, r, sum / 2);
    };
    dfs(dfs, 0, 1 << N, K);

    cout << (K % (1 << N) == 0 ? 0 : 1) << "\n";
    for (int i = 0; i < 1 << N; i++) {
        cout << ans[i] << " \n"[i + 1 == 1 << N];
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    solve();
    return 0;
}

提出情報

ジャッジ結果