結果

問題 No.1087 転倒数の転倒数
ユーザー vwxyzvwxyz
提出日時 2023-12-03 11:14:48
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 199 ms / 2,000 ms
コード長 7,365 bytes
コンパイル時間 406 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 86,404 KB
最終ジャッジ日時 2024-09-26 22:05:21
合計ジャッジ時間 14,890 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
55,044 KB
testcase_01 AC 47 ms
55,552 KB
testcase_02 AC 47 ms
55,296 KB
testcase_03 AC 47 ms
55,040 KB
testcase_04 AC 48 ms
55,296 KB
testcase_05 AC 49 ms
55,424 KB
testcase_06 AC 47 ms
55,296 KB
testcase_07 AC 52 ms
57,216 KB
testcase_08 AC 55 ms
63,360 KB
testcase_09 AC 55 ms
63,360 KB
testcase_10 AC 49 ms
55,168 KB
testcase_11 AC 50 ms
55,040 KB
testcase_12 AC 189 ms
85,444 KB
testcase_13 AC 48 ms
55,552 KB
testcase_14 AC 63 ms
67,200 KB
testcase_15 AC 48 ms
55,552 KB
testcase_16 AC 62 ms
67,072 KB
testcase_17 AC 153 ms
86,404 KB
testcase_18 AC 47 ms
55,680 KB
testcase_19 AC 47 ms
55,296 KB
testcase_20 AC 64 ms
66,816 KB
testcase_21 AC 160 ms
83,456 KB
testcase_22 AC 48 ms
55,424 KB
testcase_23 AC 49 ms
55,040 KB
testcase_24 AC 81 ms
76,928 KB
testcase_25 AC 157 ms
82,688 KB
testcase_26 AC 148 ms
82,688 KB
testcase_27 AC 124 ms
80,204 KB
testcase_28 AC 121 ms
79,744 KB
testcase_29 AC 121 ms
81,608 KB
testcase_30 AC 97 ms
78,848 KB
testcase_31 AC 134 ms
83,712 KB
testcase_32 AC 134 ms
83,236 KB
testcase_33 AC 113 ms
80,580 KB
testcase_34 AC 199 ms
85,504 KB
testcase_35 AC 171 ms
85,156 KB
testcase_36 AC 182 ms
85,192 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
readline=sys.stdin.readline
from collections import defaultdict

def Inversion_Number(lst,weight=False,weakly=False):
    compress,decompress=Compress(lst)
    compressed_lst=[compress[x] for x in lst]
    N=len(compress)
    if not weight:
        weight=[1]*len(lst)
    ST=Segment_Tree(N,lambda x,y:x+y,0)
    inversion_number=0
    for c,x in zip(weight,compressed_lst):
        inversion_number+=ST.Fold(x if weakly else x+1,N)*c
        ST[x]+=c
    return inversion_number

def Compress(lst):
    decomp=sorted(list(set(lst)))
    comp={x:i for i,x in enumerate(decomp)}
    return comp,decomp

class Segment_Tree:
    def __init__(self,N,f,e,lst=None,dynamic=False):
        self.f=f
        self.e=e
        self.N=N
        if dynamic:
            self.segment_tree=defaultdict(lambda:self.e)
        else:
            if lst==None:
                self.segment_tree=[self.e]*2*self.N
            else:
                assert len(lst)<=self.N
                self.segment_tree=[self.e]*self.N+[x for x in lst]+[self.e]*(N-len(lst))
                for i in range(self.N-1,0,-1):
                    self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])

    def __getitem__(self,i):
        if type(i)==int:
            if -self.N<=i<0:
                return self.segment_tree[i+self.N*2]
            elif 0<=i<self.N:
                return self.segment_tree[i+self.N]
            else:
                raise IndexError("list index out of range")
        else:
            a,b,c=i.start,i.stop,i.step
            if a==None:
                a=self.N
            else:
                a+=self.N
            if b==None:
                b=self.N*2
            else:
                b+=self.N
            return self.segment_tree[slice(a,b,c)]

    def __setitem__(self,i,x):
        if -self.N<=i<0:
            i+=self.N*2
        elif 0<=i<self.N:
            i+=self.N
        else:
            raise IndexError("list index out of range")
        self.segment_tree[i]=x
        while i>1:
            i>>= 1
            self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])

    def Build(self,lst):
        for i,x in enumerate(lst,self.N):
            self.segment_tree[i]=x
        for i in range(self.N-1,0,-1):
            self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])

    def Fold(self,L=None,R=None):
        if L==None:
            L=self.N
        else:
            L+=self.N
        if R==None:
            R=self.N*2
        else:
            R+=self.N
        vL=self.e
        vR=self.e
        while L<R:
            if L&1:
                vL=self.f(vL,self.segment_tree[L])
                L+=1
            if R&1:
                R-=1
                vR=self.f(self.segment_tree[R],vR)
            L>>=1
            R>>=1
        return self.f(vL,vR)

    def Fold_Index(self,L=None,R=None):
        if L==None:
            L=self.N
        else:
            L+=self.N
        if R==None:
            R=self.N*2
        else:
            R+=self.N
        if L==R:
            return None
        x=self.Fold(L-self.N,R-self.N)
        while L<R:
            if L&1:
                if self.segment_tree[L]==x:
                    i=L
                    break
                L+=1
            if R&1:
                R-=1
                if self.segment_tree[R]==x:
                    i=R
                    break
            L>>=1
            R>>=1
        while i<self.N:
            if self.segment_tree[i]==self.segment_tree[i<<1]:
                i<<=1
            else:
                i<<=1
                i|=1
        i-=self.N
        return i

    def Bisect_Right(self,L=None,f=None):
        if L==self.N:
            return self.N
        if L==None:
            L=0
        L+=self.N
        vl=self.e
        vr=self.e
        l,r=L,self.N*2
        while l<r:
            if l&1:
                vl=self.f(vl,self.segment_tree[l])
                l+=1
            if r&1:
                r-=1
                vr=self.f(self.segment_tree[r],vr)
            l>>=1
            r>>=1
        if f(self.f(vl,vr)):
            return self.N
        v=self.e
        while True:
            while L%2==0:
                L>>=1
            vv=self.f(v,self.segment_tree[L])
            if f(vv):
                v=vv
                L+=1
            else:
                while L<self.N:
                    L<<=1
                    vv=self.f(v,self.segment_tree[L])
                    if f(vv):
                        v=vv
                        L+=1
                return L-self.N

    def Bisect_Left(self,R=None,f=None):
        if R==0:
            return 0
        if R==None:
            R=self.N
        R+=self.N
        vl=self.e
        vr=self.e
        l,r=self.N,R
        while l<r:
            if l&1:
                vl=self.f(vl,self.segment_tree[l])
                l+=1
            if r&1:
                r-=1
                vr=self.f(self.segment_tree[r],vr)
            l>>=1
            r>>=1
        if f(self.f(vl,vr)):
            return 0
        v=self.e
        while True:
            R-=1
            while R>1 and R%2:
                R>>=1
            vv=self.f(self.segment_tree[R],v)
            if f(vv):
                v=vv
            else:
                while R<self.N:
                    R=2*R+1
                    vv=self.f(self.segment_tree[R],v)
                    if f(vv):
                        v=vv
                        R-=1
                return R+1-self.N

    def __str__(self):
        return "["+", ".join(map(str,self.segment_tree[self.N:]))+"]"

def check(N):
    retu=[[None]*N for i in range(N)]
    for i in range(N):
        for j in range(N):
            S=[[0]*N for i in range(N)]
            #for ii in range(N):
            #    for jj in range(N):
            #        if i==ii or j==jj:
            #            S[ii][jj]=1
            S[i][j]=1
            A=[Inversion_Number(S[i]) for i in range(N)]
            B=[Inversion_Number([S[i][j] for i in range(N)]) for j in range(N)]
            retu[i][j]=Inversion_Number(A)+Inversion_Number(B)
    return retu

"""
for N in range(2,6):
    lst=check(N)
    for i in range(N):
        print(*lst[i])
    print()
"""

N,K=map(int,readline().split())
S=[[0]*N for i in range(N)]
if N*(N-1)<K:
    print("No")
else:
    print("Yes")
    s=0
    for i in range(N):
        if K<=2*(N-i-1):
            if K==1:
                for x in range(i,N):
                    for y in range(i,N):
                        if x==i or y==i+1:
                            S[x][y]=s+1
                        else:
                            S[x][y]=s
            elif K==0:
                for x in range(i,N):
                    for y in range(i,N):
                        S[x][y]=s
            else:
                for x in range(i,N):
                    for y in range(i,N):
                        S[x][y]=s
                x=min(N-i-2,2*(N-i-1)-K)
                y=2*(N-i-1)-K-x
                S[i+x][i+y]=s+1
            break
        else:
            K-=2*(N-i-1)
            for y in range(i+1,N):
                S[i][y]=s+(N-1-y)
            for x in range(i+1,N):
                S[x][i]=s+(N-1-x)
            S[i][i]=s+(N-1-i)
            s+=(N-i)
    for i in range(N):
        print(*S[i])
0