Submission #954988
Source Code Expand
n,x=map(int,raw_input().split()) if n==2 and x==2: print("Yes") print(1) print(2) print(3) exit() elif n==2 and x!=2: print("No") exit() ans=[0]*(2*n-1) if x-2>=1 and x+2<=2*n-1: print("Yes") ans[(2*n-1)/2]=x ans[(2*n-1)/2+1]=x+1 ans[(2*n-1)/2-1]=x-1 ans[(2*n-1)/2+2]=x-2 ans[(2*n-1)/2-2]=x+2 j=1 i=0 while i<2*n-1: if j==x or j==x-1 or j==x+1 or j==x+2 or j==x-2: j+=1 continue if ans[i]!=0: i+=1 continue else: ans[i]=j j+=1 i+=1 for i in xrange(2*n-1): print(ans[i]) else: print("No")
Submission Info
Submission Time | |
---|---|
Task | B - Median Pyramid Easy |
User | roto_37 |
Language | Python (2.7.6) |
Score | 0 |
Code Size | 709 Byte |
Status | WA |
Exec Time | 222 ms |
Memory | 10244 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||
Status |
|
|
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 | 16 ms | 2696 KB |
0_01.txt | AC | 17 ms | 2696 KB |
1_00.txt | AC | 16 ms | 2696 KB |
1_01.txt | AC | 16 ms | 2696 KB |
1_02.txt | AC | 16 ms | 2696 KB |
1_03.txt | AC | 16 ms | 2696 KB |
1_04.txt | WA | 17 ms | 2696 KB |
1_05.txt | AC | 17 ms | 2696 KB |
1_06.txt | WA | 17 ms | 2696 KB |
1_07.txt | AC | 16 ms | 2696 KB |
1_08.txt | AC | 20 ms | 4228 KB |
1_09.txt | WA | 20 ms | 4228 KB |
1_10.txt | AC | 218 ms | 10244 KB |
1_11.txt | AC | 222 ms | 10244 KB |
1_12.txt | AC | 222 ms | 10244 KB |
1_13.txt | WA | 20 ms | 4228 KB |
1_14.txt | AC | 20 ms | 4228 KB |
1_15.txt | AC | 17 ms | 2948 KB |
1_16.txt | WA | 19 ms | 3588 KB |
1_17.txt | AC | 219 ms | 9988 KB |
1_18.txt | WA | 18 ms | 3332 KB |
1_19.txt | AC | 17 ms | 3076 KB |