Submission #2123504

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <stdlib.h>
#include <functional>
#include <string>
#include <list>
#include <fstream>
#include <iomanip>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <nmmintrin.h>
#include <chrono>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define MODU 1000000007
#define bitcheck(a,b)   ((a >> b) & 1)
#define bitset(a,b)      ( a |= (1 << b))
#define bitunset(a,b)    (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a%b);
}
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
	std::fill((T*)array, (T*)(array + N), val);
}

struct Edge {
	int from, to;
};

signed main()
{
	int n,x;
	cin >> n >> x;

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

	cout << "Yes" << endl;

	if (n == 2) {
		cout << "1\n2\n3" << endl;
	}
	else {
		if (x == 2 * n - 2) {
			vector<int> out;
			rep(i, 1, n*2) {
				if (i != x - 2 && i != x - 1 && i != x && i != x + 1)
					out.push_back(i);
				
			}
			REP(i, (n * 2 - 1 -4)/2) {
				cout << out[i] << "\n";
			}
			cout << x-2 << "\n" << x << "\n" << x + 1 << "\n" << x - 1 << "\n";
			 
			rep(i, (n * 2 - 1 - 4) / 2, out.size()) {
				cout << out[i] << "\n";
			}
		}
		else {
			vector<int> out;
			rep(i, 1, n * 2) {
				if (i != x + 2 && i != x + 1 && i != x && i != x - 1)
					out.push_back(i);

			}
			REP(i, (n*2-1 - 4) / 2) {
				cout << out[i] << "\n";
			}
			cout << x + 2 << "\n" << x << "\n" << x - 1 << "\n" << x + 1 << "\n";

			rep(i, (n * 2 - 1 - 4) / 2, out.size()) {
				cout << out[i] << "\n";
			}
		}
	}




	return 0;
}

Submission Info

Judge Result