Submission #2119759


Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
using namespace std;

typedef pair<int,int> P;

#define rep(i,s,e) for(int i = (s);i <= (e);i++)

int n;
int x;

int main()
{
	cin >> n >> x;
	if(n == 2)
	{
		if(x == 1 || x == 3)
		{
			cout << "No" << endl;
		}
		else
		{
			cout << "Yes" << endl;
			cout << 1 << endl;
			cout << 2 << endl;
			cout << 3 << endl;
		}
		return 0;
	}
	int MAX = 2 * n - 1;
	if(1 <= x - 1 && x + 2 <= MAX)
	{
		cout << "Yes" << endl;
		queue<int> able;

		rep(i,1,MAX)
		{
			if(x - 1 <= i && i <= x + 2)
				continue;
			able.push(i);
		}
		rep(i,1,n - 3)
		{
			cout << able.front() << endl;
			able.pop();
		}
		cout << x + 2 << endl;
		cout << x - 1 << endl;
		cout << x << endl;
		cout << x + 1 << endl;
		rep(i,n + 2,MAX)
		{
			cout << able.front() << endl;
			able.pop();
		}
	}
	else if(1 <= x - 2 && x + 1 <= MAX)
	{
		cout << "Yes" << endl;
		queue<int> able;

		rep(i,1,MAX)
		{
			if(x - 2 <= i && i <= x + 1)
				continue;
			able.push(i);
		}
		rep(i,1,n - 3)
		{
			cout << able.front() << endl;
			able.pop();
		}
		cout << x - 1 << endl;
		cout << x + 1  << endl;
		cout << x << endl;
		cout << x - 2 << endl;
		rep(i,n + 2,MAX)
		{
			cout << able.front() << endl;
			able.pop();
		}
	}
	else 
	{
		cout << "No" << endl;
	}

	return 0;
}

Submission Info

Submission Time
Task B - Median Pyramid Easy
User niuez
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1425 Byte
Status AC
Exec Time 319 ms
Memory 2304 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 305 ms 2304 KB
1_10.txt AC 310 ms 2304 KB
1_11.txt AC 319 ms 2304 KB
1_12.txt AC 316 ms 2304 KB
1_13.txt AC 309 ms 2304 KB
1_14.txt AC 1 ms 256 KB
1_15.txt AC 1 ms 256 KB
1_16.txt AC 185 ms 1408 KB
1_17.txt AC 304 ms 2304 KB
1_18.txt AC 129 ms 1024 KB
1_19.txt AC 1 ms 256 KB