Submission #954998

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <utility>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <istream>
#include <ostream>

#include <cstdlib>
#include <cmath>
#include <cstdio>

using namespace std;

#define fi first
#define se second
#define mkp make_pair
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define rep(i,n) for(ll i=0; i < (n); ++i)
#define rrep(i,n) for(ll i=((n)-1); i >= 0; --i)

#define OPLT(T) bool operator<(const T & lop_, const T & rop_)
#define OPEQ(T) bool operator==(const T & lop_, const T & rop_)

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

istream& operator>>(istream& istr, __float128& obj) { double d; istr >> d; obj = d; return istr; };
ostream& operator<<(ostream& ostr, __float128& obj) { ostr << static_cast<double>(obj); return ostr; };

int main() {
	int N, x;
	const string ok = "Yes", ng = "No";
	cin >> N >> x;
	if(x == N*2-1 || x == 1) {
		cout << ng << endl;
		return 0;
	}
	if(N == 2) {
		cout << ok << endl;
		for(int i = 0; i < 2*N-1; i++) {
			cout << i+1 << endl;
		}
		return 0;
	}

	vector<int> a, b;
	a.resize(4);
	if(x == 2) {
		a[0] = x+1;
		a[1] = x;
		a[2] = x-1;
		a[3] = x+2;
	}
	else {
		a[0] = x-1;
		a[1] = x;
		a[2] = x+1;
		a[3] = x-2;
	}
	for(int i = 0; i < 2*N-1; i++) {
		if(x == 2) {
			if(!(x-1 <= i+1 && i+1 <= x+2))
				b.push_back(i+1);
			else
				b.push_back(a[i+1 - (x-1)]);
		}
		else {
			if(!(x-2 <= i+1 && i+1 <= x+1))
				b.push_back(i+1);
			else
				b.push_back(a[i+1 - (x-2)]);
		}
	}

	cout << ok << endl;
	for(int i = 0; i < b.size(); i++)
		cout << b[i] << endl;

	return 0;
}

Submission Info

Judge Result