Submission #1754046


Source Code Expand

#include <bits/stdc++.h>
#define long long long
#define up(i,a,b) for (int i=a; i<=b; i++)
#define down(i,a,b) for (int i=a; i>=b; i--)
#define endl '\n'
#define X first
#define Y second
#define II pair<int, int>
#define III pair<int, pair<int, int> >
#define debug(X) cerr<< #X << " = " <<X << endl
#define debug2(X,Y) cerr<< #X << " = " <<X << ","<<#Y<<" = "<<Y<<endl
#define show(X,a,b) {cerr << #X << " = "; up(__,a,b) cerr << X[__] << ' '; cerr << endl;}
#define gc getchar
#define pc putchar
using namespace std;
int n,x,a[200010],ok[200010];
void input()
{
    cin>>n>>x;
}

void solve()
{
	if (x==1 or x== 2*n-1)
	{
		cout<<"No"; return;
	}

    a[n]= x; a[n-1]= x-1; a[n+1]= x+1;
    if (n>2)
	{
		if (x!= 2) a[n-2]= x-2;
		else a[n-2]= x+2;
	}

    up(i,n-2,n+1) ok[a[i]]= 1;
    int cur= 1;
    up(i,1,2*n-1)
     if (!a[i])
	 {
	 	while (ok[cur]) cur++;
	 	a[i]= cur; ok[cur]= 1;
	 }
	 cout<<"Yes"<<endl;
	 up(i,1,2*n-1) cout<<a[i]<<endl;

}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);// don't use when interactive

    #ifdef I_Love_Pork
    #define TASK "tmp"
    freopen(TASK".inp","r",stdin);
    freopen(TASK".out","w",stdout);
	  #endif

    input();
    solve();

    return 0;
}

Submission Info

Submission Time
Task B - Median Pyramid Easy
User I_Love_Pork
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1290 Byte
Status AC
Exec Time 17 ms
Memory 3072 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 22
Set Name Test Cases
Sample 0_00.txt, 0_01.txt
All 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 1 ms 256 KB
1_07.txt AC 1 ms 256 KB
1_08.txt AC 1 ms 256 KB
1_09.txt AC 17 ms 3072 KB
1_10.txt AC 17 ms 3072 KB
1_11.txt AC 17 ms 3072 KB
1_12.txt AC 17 ms 3072 KB
1_13.txt AC 17 ms 3072 KB
1_14.txt AC 1 ms 256 KB
1_15.txt AC 1 ms 256 KB
1_16.txt AC 10 ms 1920 KB
1_17.txt AC 17 ms 3072 KB
1_18.txt AC 8 ms 1408 KB
1_19.txt AC 1 ms 256 KB