Submission #1605362


Source Code Expand

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = float("inf")


def solve(N, x):
    que = deque(list(i for i in range(1, 2 * N) if i != x))
    ans = deque([x])
    i = 0
    while que:
        a = que.popleft()
        b = que.pop()
        if i % 2 == 0:
            ans.appendleft(a)
            ans.append(b)
        else:
            ans.appendleft(b)
            ans.append(a)
        i += 1
    return ans


def main():
    N, x = map(int, input().split())
    if 1 < x < 2 * N - 1:
        print("Yes")
        print(*solve(N, x), sep="\n")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission Info

Submission Time
Task B - Median Pyramid Easy
User MitI_7
Language Python (3.4.3)
Score 400
Code Size 841 Byte
Status AC
Exec Time 160 ms
Memory 15776 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 21 ms 3316 KB
0_01.txt AC 21 ms 3316 KB
1_00.txt AC 21 ms 3316 KB
1_01.txt AC 21 ms 3316 KB
1_02.txt AC 21 ms 3316 KB
1_03.txt AC 21 ms 3316 KB
1_04.txt AC 21 ms 3316 KB
1_05.txt AC 21 ms 3316 KB
1_06.txt AC 21 ms 3316 KB
1_07.txt AC 21 ms 3316 KB
1_08.txt AC 21 ms 3316 KB
1_09.txt AC 159 ms 15776 KB
1_10.txt AC 159 ms 15776 KB
1_11.txt AC 159 ms 15776 KB
1_12.txt AC 159 ms 15776 KB
1_13.txt AC 160 ms 15776 KB
1_14.txt AC 21 ms 3316 KB
1_15.txt AC 21 ms 3316 KB
1_16.txt AC 99 ms 10464 KB
1_17.txt AC 152 ms 15356 KB
1_18.txt AC 88 ms 8420 KB
1_19.txt AC 21 ms 3316 KB