Submission #6441297
Source Code Expand
N,x = map(int,input().split()) ans = (list(range(1,2*N))*2)[(x-N)%(2*N-1):(x-N)%(2*N-1)+2*N-1] if x==1 or x==2*N-1:ans = [] if ans: print("Yes") print(*ans) else: print("No")
Submission Info
Submission Time | |
---|---|
Task | B - Median Pyramid Easy |
User | ttm8761 |
Language | Python (3.4.3) |
Score | 400 |
Code Size | 188 Byte |
Status | AC |
Exec Time | 133 ms |
Memory | 15640 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 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 | 17 ms | 2940 KB |
0_01.txt | AC | 17 ms | 3060 KB |
1_00.txt | AC | 17 ms | 2940 KB |
1_01.txt | AC | 17 ms | 2940 KB |
1_02.txt | AC | 17 ms | 3060 KB |
1_03.txt | AC | 17 ms | 3060 KB |
1_04.txt | AC | 17 ms | 2940 KB |
1_05.txt | AC | 17 ms | 2936 KB |
1_06.txt | AC | 17 ms | 2940 KB |
1_07.txt | AC | 17 ms | 3060 KB |
1_08.txt | AC | 29 ms | 14068 KB |
1_09.txt | AC | 109 ms | 15620 KB |
1_10.txt | AC | 109 ms | 15620 KB |
1_11.txt | AC | 129 ms | 15640 KB |
1_12.txt | AC | 133 ms | 15620 KB |
1_13.txt | AC | 108 ms | 15620 KB |
1_14.txt | AC | 29 ms | 14068 KB |
1_15.txt | AC | 19 ms | 4616 KB |
1_16.txt | AC | 78 ms | 10452 KB |
1_17.txt | AC | 127 ms | 15268 KB |
1_18.txt | AC | 54 ms | 8412 KB |
1_19.txt | AC | 20 ms | 5876 KB |