Submission #1408076

---

Source Code Expand

#include<string>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<chrono>
#include<functional>
#include<random>
#include<unordered_set>
using namespace std;
typedef long long int llint;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
const llint mod=1000000007;
const llint big=1e17-10;
const long double pai=3.141592653589793238462643383279;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
int main(void){
	int n,x,i;cin>>n>>x;
	if(x==1||x==2*n-1){cout<<"No"<<endl;return 0;}
	cout<<"Yes"<<endl;
	int j=3;
	for(i=0;i<2*n-1;i++){
		if(i==n){cout<<2*n-1<<endl;continue;}
		if(i==n-1){cout<<x<<endl;continue;}
		if(i==n-2){cout<<1<<endl;continue;}
		if(i==n-3&&x!=2*n-2){cout<<2*n-2<<endl;continue;}
		if(i==n+1&&x!=2){cout<<2<<endl;continue;}
		if(j==x){j++;}
		cout<<j<<endl;
		j++;
	}
	return 0;
}

Submission Info

Judge Result