Spiraali

n, t=input().split()
n=int(n)
t=int(t)

def le(l):
	return n-(2*l)

def ledge(l):
	return n-(2*l)

def ps(l):
	edgeL = le(l)
	return edgeL * 2 + (edgeL - 2) * 2

def ls(l):
        return-4*(l**2)+((4*n)*l)

def lbounds(l):
        return (l+1, n-l)

def getspiral(x, y):
        yn = int(0)
        xn = int(0)
        if x > n/2:
                xn = int(x - n/2)
                xn = int(n/2-xn)
        else:
                xn = int(x-1)
        if y > n/2:
                yn = int(y - n/2)
                yn = int(n/2-yn)
        else:
                yn = int(y-1)
        level = int(min(yn, xn))
        l=level
        #print(f"level: {level}")
        #print(f"bounds: {lbounds(l)}")
        #print(f"edge length: {ledge(l)}")
        outn = int(ls(level))
        
        #print(f"levels under sum: {ls(l)}")

        if x==1 and y==1:
                return 1
        
        if x == lbounds(l)[0]:
                # left edge
                outn += 1
                return outn + int(y - lbounds(l)[0])
        elif x == lbounds(l)[1]:
                # right edge
                outn += (2*ledge(l)-1)
                return outn + int(lbounds(l)[1] - y)
        elif y == lbounds(l)[0]:
                # top edge
                outn += (3*ledge(l)-2)
                return outn + int(lbounds(l)[1] - x)
        elif y == lbounds(l)[1]:
                # bottom edge
                outn += (ledge(l))
                return outn + int(x - lbounds(l)[0])
        return int(outn)
        
outs = ""
for i in range(0, t):
        y, x=input().split()
        x=int(x)
        y=int(y)
        outs += "%d" % getspiral(x, y)
        if i+1 != t:
                outs += "\n"

print(outs)

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED