Submission #955001

---

Source Code Expand

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define de(x) cout << #x << "=" << x << endl
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int n , x , ans[202020];

int main(){
    cin >> n >> x;
    if(x == 1 || x == n + n - 1) return puts("No") , 0;
    puts("Yes");
    int l = n , r = n;
    ans[n] = x;
    int lft = 1 , rgt = n + n - 1;
    for(;;){
        if(lft == x) lft++;
        if(rgt == x) rgt--;
        ans[--l] = lft , ans[++r] = rgt;
        lft++;rgt--;
        if(l == 1) break;
        if(lft == x) lft++;
        if(rgt == x) rgt--;
        ans[--l] = rgt , ans[++r] = lft;
        lft++;rgt--;
        if(l == 1) break;
    }
    rep(i,1,n+n) printf("%d\n",ans[i]);
    return 0;
}

Submission Info

Judge Result