Submission #954980


Source Code Expand

#include<bits/stdc++.h>

using namespace std;

const int MAXN = 3e5 + 10;

int n, x, sec[MAXN], sz;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> x;
	if (n == 2){
		if (x == 2){
			cout << "Yes\n";
			cout << "1\n2\n3\n";
		}
		else
			cout << "No\n";
		return 0;
	}
	int mx = n+n-1;
	if (x == 1 || x == mx){
		cout << "No\n";
		return 0;
	}
	cout << "Yes\n";
	for (int i = 1; i <= mx; i++)
		if (i < x - 2 || i > x + 2)	sec[sz++] = i;

	for (int i = 0; i < sz/2; i++)
		cout << sec[i] << "\n";
	if (x + 2 <= mx)
		cout << x+2 << "\n";
	cout << x - 1 << "\n";
	cout << x << "\n";
	cout << x + 1 << "\n";
	if (x - 2 > 0)
		cout << x - 2 << "\n";
	for (int i = sz/2; i < sz; i++)
		cout << sec[i] << "\n";
	return 0;
}

Submission Info

Submission Time
Task B - Median Pyramid Easy
User Deemo
Language C++14 (GCC 5.4.1)
Score 400
Code Size 783 Byte
Status AC
Exec Time 20 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 3 ms 256 KB
0_01.txt AC 3 ms 256 KB
1_00.txt AC 3 ms 256 KB
1_01.txt AC 3 ms 256 KB
1_02.txt AC 3 ms 256 KB
1_03.txt AC 3 ms 256 KB
1_04.txt AC 3 ms 256 KB
1_05.txt AC 3 ms 256 KB
1_06.txt AC 3 ms 256 KB
1_07.txt AC 3 ms 256 KB
1_08.txt AC 3 ms 256 KB
1_09.txt AC 20 ms 2304 KB
1_10.txt AC 19 ms 2304 KB
1_11.txt AC 19 ms 2304 KB
1_12.txt AC 19 ms 2304 KB
1_13.txt AC 19 ms 2304 KB
1_14.txt AC 3 ms 256 KB
1_15.txt AC 3 ms 256 KB
1_16.txt AC 12 ms 1408 KB
1_17.txt AC 19 ms 2304 KB
1_18.txt AC 9 ms 1024 KB
1_19.txt AC 3 ms 256 KB