Submission #2545543

---

Source Code Expand

#include <iostream>
#include <cstdio>
#define N 200005
using namespace std;

int n, x, a[N];
bool v[N];

void f(int p, int q) {
	a[n + p] = x + q;
	v[x + q] = 1;
}

int main()
{
	int i, j;
	cin >> n >> x;
	if (x == 1 || x == n * 2 - 1) {cout << "No"; return 0;}
	cout << "Yes\n";
	if (x == 2) f(-1, -1), f(0, 0), f(1, 1), f(2, -2);
	else f(-1, 1), f(0, 0), f(1, -1), f(2, 2);
	for (i = j = 1; i < 2 * n; i++) {
		if (!a[i]) {
			for (; v[j]; j++);
			a[i] = j++;
		}
		printf("%d\n", a[i]);
	}
    return 0;
}

Submission Info

Judge Result