Submission #1336981

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll MOD = 1000000007;

int main(){
    int N, x;
    cin >> N >> x;

    if(x == 1 || x == 2 * N - 1){
        cout << "No" << endl;
        return 0;
    }

    cout << "Yes" << endl;
    int n = 2*N - 1;
    vector<int> ans(n, 0);
    if (N == 2){
        ans = {1, 2, 3};
    }else{
        int nd = n / 2;
        int l, r;
        if(x+2 <= n){
            ans[nd-1] = x+1;
            ans[nd] = x-1;
            ans[nd+1] = x;
            ans[nd+2] = x+2;
            l = x-1;
            r = x+2;
        }else{
            ans[nd-1] = x-1;
            ans[nd] = x+1;
            ans[nd+1] = x;
            ans[nd+2] = x-2;
            l = x-2;
            r = x+1;
        }

        int k = 1;
        for(int i=0;i<n;i++){
            while(l <= k && k <= r) k++;
            if(ans[i] == 0) ans[i] = k++;
        }
    }

    for(int i=0;i<n;i++){
        cout << ans[i] << endl;
    }
    return 0;
}

Submission Info

Judge Result