#1170676 (C++17) No.3766 PQ Disjunction

• 問題: No.3766 PQ Disjunction
• ユーザー: 👑 AngrySadEight
• 提出日時: 2026-07-10 01:15:00
• 言語: C++17 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: WA
• 実行時間: -
• コード長: 4,604 bytes
• コンパイル時間: 2,615 ms
• コンパイル使用メモリ: 215,888 KB
• 実行使用メモリ: 9,804 KB
• 最終ジャッジ日時: 2026-10-16 20:52:37
• 合計ジャッジ時間: 6,790 ms
• ジャッジサーバーID （参考情報）: judge5_0 / judge4_0

ファイルパターン	結果
sample	AC * 3
other	AC * 33 WA * 1

ソースコード

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}


// とりあえずまずは最上位ビットを無視し、0 になるものを再帰的に作る
vector<ll> dfs(ll N, ll bit){
    vector<ll> Q(N);
    if (bit == -1){
        return Q;
    }
    if (N < (1 << bit)){
        Q = dfs(N, bit - 1);
    }
    else{
        vector<ll> latter = dfs(N - (1 << bit), bit - 1);
        for (ll i = 0; i < (1 << bit); i++){
            Q[i] = (1 << bit) - 1 - i;
            if (Q[i] + (1 << bit) < N){
                Q[i] += (1 << bit);
            }
        }
        for (ll i = (1 << bit); i < N; i++){
            Q[i] = latter[i - (1 << bit)];
        }
    }
    return Q;
}

int main() {
    ll N, K;
    cin >> N >> K;

    ll msb_n = -1;
    ll msb_k = -1;
    for (ll i = 0; i < 18; i++){
        if (((N - 1) >> i) & 1) msb_n = max(msb_n, i);
        if ((K >> i) & 1) msb_k = max(msb_k, i);
    }
    if (msb_n < msb_k){
        cout << "No" << endl;
        return 0;
    }
    cout << "Yes" << endl;
    vector<ll> P(N);
    rep(i, N) P[i] = i;
    
    // 実質再帰的にやって、まずは 0 から作る
    vector<ll> Q = dfs(N, msb_n);

    if (K >= (1 << msb_n)){
        for (ll i = 0; i < N; i++){
            if (Q[i] >= (1 << msb_n)) Q[i] -= (1 << msb_n);
            else if (Q[i] + (1 << msb_n) < N) Q[i] += (1 << msb_n);
        }
    }
    ll rem = K % (1 << msb_n);
    if (rem == (1 << msb_n) - 1){
        swap(Q[0], Q[(1 << msb_n) - 1]);
    }
    else if (rem != 0){
        swap(Q[0], Q[rem]);
        swap(Q[(1 << msb_n) - 1], Q[(1 << msb_n) - 1 - rem]);
    }
    rep(i, N){
        cout << P[i];
        if (i < N - 1) cout << " ";
    }
    cout << endl;
    rep(i, N){
        cout << Q[i];
        if (i < N - 1) cout << " ";
    }
    cout << endl;
}