Submission #2549689

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 200005;

int n, k;

int T[MAXN];
int a[MAXN];

int main()
{
	ios::sync_with_stdio(false);
	cin >> n >> k;
        if (k == 1 || k == 2*n-1) cout << "No" << endl;
	else {
		cout << "Yes" << endl;
		if (n == 2) {
			cout << 1 << endl << 2 << endl << 3 << endl;
		} if (k > 2) {
			T[1] = T[2] = T[k] = T[k+1] = 1;
			a[n] = k, a[n-1] = 1, a[n+1] = k+1, a[n+2] = 2;
			for (int i = 1, j = 1; i <= n*2-1; i++) {
				while (T[j]) j++;
				if (!a[i]) a[i] = j++;
				cout << a[i] << endl;
			}
		} else {
			T[1] = T[k] = T[k+1] = T[k+2] = 1;
			a[n] = k, a[n-1] = 1, a[n+1] = k+1, a[n-2] = k+2;
			for (int i = 1, j = 1; i <= n*2-1; i++) {
				while (T[j]) j++;
				if (!a[i]) a[i] = j++;
				cout << a[i] << endl;
			}
		}
	}
	return 0;
}

Submission Info

Judge Result