Submission #1438183

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef pair<int, int> P;

signed main(){
    int n, x;
    cin >> n >> x;
    if(x == 1 || x == 2 * n - 1) cout << "No" << endl;
    else{
        cout << "Yes" << endl;
        int now = x - n;
        rep(i, 0, 2 * n - 1){
            cout << (now + 2 * n - 1) % (2 * n - 1) + 1 << endl;
            now++;
        }
    }
}

Submission Info

Judge Result