Submission #1766448

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<string>
#include<sstream>
#include<cmath>
#include<climits>
#include<algorithm>
#include<bitset>
#include<set>
#include<stack>
#include<queue>
#include<iomanip>
#include<memory.h>
#include<complex>
using namespace std;  
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef tuple<int,int> tii;
#define rep(i,n) for(ll i=0;i<(n);i++)  
#define pb push_back
#define mt make_tuple
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second  
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-8;
const double PI = M_PI;  
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define SHOWARRAY(ar,i,j) REP(a,i)REP(b,j)cerr<<ar[a][b]<<((b==j-1)?((a==i-1)?("\n\n"):("\n")):(" "))
#define DIV int(1e9+7)
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;}

 /* Coding Space*/
vector<bool> used(200002,0);
int main(){
  int n,x; cin >> n >> x;
  if(x == 1 || x == 2*n-1) {cout << "No" << endl; return 0;}
  if(n == 2 && x == 2){cout<<"Yes\n1\n2\n3\n";return 0;}
  cout << "Yes" << endl;
  vi cent = {x-1,x,x+1,x-2};
  if(x == 2)
    cent = {x+1,x,x-1,x+2};
  rep(i,4) used[cent[i]] = 1;
  int index = 1;
  rep(i,2*n-4){
    //SHOW(used[index],index);
    if(i == n-2){
      rep(j,4) cout << cent[j] << endl;
      continue;
    }
    
    if(used[index] == 1){
      index++,i--; continue;
    }
    if(used[index] == 0){
      cout << index << endl;
      used[index] = 1;
      index++;
      continue;
    }
  }
}

Submission Info

Judge Result