Submission #75826518

---

Source Code Expand

n,k = map(int,input().split())
l = len(bin(n-1))-1
if k < l:
    print(-1)
    exit()

if n == 2:
    print(3)
    print(1,1,2)
    print(0,0,0)
    print(0,0,0)
    exit()
    
x = 2**(l-1)
L = [[x,0,0,0],[x//2,0,0,0]]
for i in range(k-l-1):
    L.append([x+i+2,n,x+i+1,0])
if k == l:
    L.append([0,x//2,x-1,x//2-1])
else:
    L.append([x+1,x//2,x-1,x//2-1])

A = [i+1 for i in range(x//2)]
B = []
p = x//2+1
i = 0
g,s = 2,1
while p < x:
    if A:
        while i < len(A):
            L.append([p,s+g*(i//2),A[i],A[i+1]])
            B.append(p)
            i += 2
            p += 1
        g,s = g*2,s*2
        i = 0
        A = []
    else:
        while i < len(B):
            L.append([p,s+g*(i//2),B[i],B[i+1]])
            A.append(p)
            i += 2
            p += 1
        g,s = g*2,s*2
        i = 0
        B = []

A = [i+x//2+1 for i in range(x//2)]
B = []
p = 1
i = 0
g,s = 2,1
while p < x//2:
    if A:
        while i < len(A):
            L.append([p,s+g*(i//2)+x//2,A[i],A[i+1]])
            B.append(p)
            i += 2
            p += 1
        g,s = g*2,s*2
        i = 0
        A = []
    else:
        while i < len(B):
            L.append([p,s+g*(i//2)+x//2,B[i],B[i+1]])
            A.append(p)
            i += 2
            p += 1
        g,s = g*2,s*2
        i = 0
        B = []

L.sort()
if L[0][0] != 0:  
    print(len(L)+1)
    print(n,len(L),0)
else:
    print(len(L))
for a,b,c,d in L:
    print(min(b,n),c,d)

Submission Info

Judge Result