結果

問題 No.3271 PQ Dot Product
コンテスト
ユーザー lif4635
提出日時 2025-09-16 17:00:53
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 161 ms / 1,000 ms
コード長 3,336 bytes
コンパイル時間 359 ms
コンパイル使用メモリ 82,844 KB
実行使用メモリ 102,284 KB
最終ジャッジ日時 2025-09-16 17:01:05
合計ジャッジ時間 11,985 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

diff # 

# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

def graph(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[int]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b = map(int, input().split())
        a += index
        b += index
        edge[a].add(b)
        if not dir:
            edge[b].add(a)
    return edge

def graph_w(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[tuple]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b,c = map(int, input().split())
        a += index
        b += index
        edge[a].add((b,c))
        if not dir:
            edge[b].add((a,c))
    return edge

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")
def acc(a:list[int]):
    sa = [0]*(len(a)+1)
    for i in range(len(a)):
        sa[i+1] = a[i] + sa[i]
    return sa

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right

from itertools import permutations


# def calc(n):
#     ok = DD(list)
#     for p in permutations(range(1, n+1)):
#         c = 0
#         for i in range(n):
#             c += (i+1) * p[i]
#         ok[c].append(p)
    
#     ok = sorted(ok.items())
#     print(ok)

# for n in range(2, 5):
#     calc(n)

n, k = MI()

ans = 0
for i in range(1, n+1):
    ans += i * i

if ans < k:
    no()
    exit()

d = ans - k

tri = [0] * n
for i in range(1, n):
    tri[i] = i * (i+1) // 2

q = []
que = deque(range(1, n+1))
for i in reversed(range(4, n)):
    if d >= tri[i]:
        d -= tri[i]
        # i 個 rotete
        while len(que) > i+1:
            q.append(que.popleft())
        q.append(que.pop())

while len(que) > 4:
    q.append(que.popleft())

p = [*range(1, n+1)]
r = 0
for i in range(len(q)):
    r += p[i] * q[i]

for q2 in permutations(que):
    d = 0
    for i in range(len(que)):
        d += q2[~i] * p[~i]
    if r + d == k:
        yes()
        print(*p)
        print(*q, *q2)
        exit()
    # print(r, d, k)
no()
# yes()
# print(*p)
# print(*q)

# print(d, r, k)
# assert r == k
0