Submission #2548704

Source Code Expand

N,x=map(int,input().split())
if x==1 or x==2*N-1:
  print("No")
else:
  print("Yes")
  ans=[int(x+1) for x in range(2*N-1)]
  if N-x > 0:
    cnt=abs(N-x)
    ans=ans[(2*N-1)-cnt:]+ans[:(2*N-1)-cnt]
  elif N-x < 0:
    cnt=abs(N-x)
    ans=ans[cnt:]+ans[:cnt]
  for i in range(2*N-1):
    print(ans[i])

Submission Info

Submission Time
Task B - Median Pyramid Easy
User kobaya0514
Language Python (3.4.3)
Score 400
Code Size 315 Byte
Status AC
Exec Time 210 ms
Memory 14104 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 17 ms 3064 KB
0_01.txt AC 17 ms 3064 KB
1_00.txt AC 17 ms 3064 KB
1_01.txt AC 17 ms 3060 KB
1_02.txt AC 17 ms 3064 KB
1_03.txt AC 17 ms 3060 KB
1_04.txt AC 17 ms 3064 KB
1_05.txt AC 17 ms 3064 KB
1_06.txt AC 17 ms 3064 KB
1_07.txt AC 17 ms 3064 KB
1_08.txt AC 17 ms 3064 KB
1_09.txt AC 187 ms 14104 KB
1_10.txt AC 195 ms 14104 KB
1_11.txt AC 210 ms 12480 KB
1_12.txt AC 204 ms 14104 KB
1_13.txt AC 198 ms 14104 KB
1_14.txt AC 17 ms 3064 KB
1_15.txt AC 17 ms 3064 KB
1_16.txt AC 116 ms 9496 KB
1_17.txt AC 186 ms 13848 KB
1_18.txt AC 98 ms 7704 KB
1_19.txt AC 19 ms 3064 KB