Submission #1352922

---

Source Code Expand

#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){
	int N,X;
	cin >> N >> X;
	vector<int> A(2*N-1,-1);
	int size = A.size();

	if( X==1 || X==(2*N-1) ){
		cout << "No" << endl;
		return;
	}
	if( N==2 ){
		for(int i=1;i<4;++i){
			cout << i << endl;
		}
	}
	if( X==2 ){
		A[N-1] = X;
		A[N-2] = 1;
		A[N-3] = 3;
		int num = 4;
		for(int i=0;i<size;++i){
			if( A[i] == -1 ){
				A[i] = num;
				++num;
				cout << A[i] << '\n';
			}else{
				cout << A[i] << '\n';
			}
		}
		cout << flush;
		return;
	}else{
		A[N-1] = X;
		A[N] = X+1;
		A[N+1] = X-1;
		A[N-2] = X-2;
		int num = 1;
		for(int i=0;i<size;++i){
			if( X-2 <= num && num <= X+1 ){
				num = X+2;
			}
			if( A[i] == -1 ){
				A[i] = num;
				++num;
				cout << A[i] << '\n';
			}else{
				cout << A[i] << '\n';
			}
		}
		cout << flush;
		return;
	}
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	
	
	solve();
}
#pragma endregion //main()

Submission Info

Judge Result