Submission #954990

---

Source Code Expand

//Daniel Grzegorzewski
#include <bits/stdc++.h>

#define MP make_pair
#define PB push_back
#define ST first
#define ND second

using namespace std;

typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef long long LL;

void init_ios()
{
     ios_base::sync_with_stdio(0);
     cin.tie(0);
}

const int N = 3*(int)1e5+10;
bool used[N];
int res[N], n, x;

int main()
{
    init_ios();
    cin >> n >> x;
    if (n == 2) {
    	if (x != 2) {
    		cout<<"No\n";
    		return 0;
    	}
    	cout<<"Yes\n1\n2\n3\n";
    	return 0;
    }
    n = 2*n-1;
    if (x == 1 || x == n) {
    	cout<<"No\n";
    	return 0;
    }
    res[n/2] = x;
    res[n/2-1] = x-1;
    res[n/2+1] = x+1;
    used[x] = used[x-1] = used[x+1] = true;
    int nr = 1;
    for (int i = 0; i < n; ++i) {
    	if (res[i] == 0) {
    		while (used[nr])
    			++nr;
    		res[i] = nr++;
    	}
    }
    cout<<"Yes\n";
    for (int i = 0; i < n; ++i)
    	cout<<res[i]<<"\n";
}

Submission Info

Judge Result