Submission #4046149

---

Source Code Expand

#include<bits/stdc++.h>

#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair 
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define Yes(hoge) cout<<((hoge)?"Yes":"No")<<endl;
#define YES(hoge) cout<<((hoge)?"YES":"NO")<<endl;
using namespace std;
struct Grid{int x,y,t;};
struct Edge{int to,cost;};
struct Graph{vector<vector<Edge>>E;int V;
  const ll Inf = llINF;const int MAX_V=1010;vector<ll>d;
  Graph(int n):E(n){d.resize(MAX_V);E.resize(n);V=n;}
  void init(){for(int i=0;i<MAX_V;i++)d[i]=Inf;}
  void add_edge(int from,int to,int cost){E[from-1].pb({to-1,cost});}
};
int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n,x;cin>>n>>x;
  if(x==1||x==2*n-1||x==2*n-2){
    cout<<"No"<<endl;
    return 0;
  }
  cout<<"Yes"<<endl;
  vector<int>ans(2*n-1);
  ans[n-1]=x;ans[n-2]=x-1;ans[n]=x+1;
  int ri=2*n-1,le=1;
  int cnt=0;
  for(int i=0;i<n-2;i++){
    while(le==x||le==x-1||le==x+1)le++;
    ans[i]=le;
    le++;
  }
  for(int i=n+1;i<2*n-1;i++){
    while(ri==x||ri==x-1||ri==x+1)ri--;
    ans[i]=ri;
    ri--;
  }
  for(int i:ans){
    cout<<i<<endl;
  }
  return 0;
}

Submission Info

Judge Result