Submission #956913


Source Code Expand

Copy
N, x = map(int, input().split())
if x == 1 or x >= 2*N-1:
	print("No")
else:
	print("Yes")
	if x == 2:
		for i in range(5,N+1):
			print(i)
		p = [4,2,3,1]
		for i in p:
			print(i)
		for i in range(N+1,2*N):
			print(i)
	else:
		a = [i for i in range(1,2*N)]
		for i in range(N-3):
			print(a[x-4-i])
		p = [x-1,x,x+1,x-2]
		for i in p:
			print(i)
		for i in range(N-2):
			print(a[(x+1+i)%(2*N-1)])

Submission Info

Submission Time
Task B - Median Pyramid Easy
User TAB
Language Python3 (3.4.3)
Score 0
Code Size 426 Byte
Status
Exec Time 192 ms
Memory 12568 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_00.txt, 0_01.txt
All 0 / 400 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 22 ms 3064 KB
0_01.txt 22 ms 3064 KB
1_00.txt 22 ms 3064 KB
1_01.txt 22 ms 3064 KB
1_02.txt 22 ms 3064 KB
1_03.txt 22 ms 3064 KB
1_04.txt 23 ms 3064 KB
1_05.txt 22 ms 3064 KB
1_06.txt 22 ms 3064 KB
1_07.txt 22 ms 3064 KB
1_08.txt 23 ms 3064 KB
1_09.txt 133 ms 4560 KB
1_10.txt 175 ms 12484 KB
1_11.txt 192 ms 12568 KB
1_12.txt 181 ms 12484 KB
1_13.txt 190 ms 12484 KB
1_14.txt 22 ms 3064 KB
1_15.txt 22 ms 3064 KB
1_16.txt 84 ms 4048 KB
1_17.txt 169 ms 12256 KB
1_18.txt 87 ms 7104 KB
1_19.txt 22 ms 3064 KB