Spiraali

def r(y,x,n,xx):
    return max(abs(int(xx[0]) - y),abs(int(xx[1]) - x))



def ring(y,x,n):

    nw = (n/2, n/2)
    ne = (n/2, (n/2)+1)
    se = ((n/2)+1,(n/2)+1)
    sw = ((n/2)+1, n/2)



    if x <= n/2 and y <= n/2:
        return int(r(y,x,n,nw))
    if x > n/2 and y <= n/2:
        return int(r(y,x,n,ne))
    if x <= n/2 and y > n/2:
        return int(r(y,x,n,sw))
    if x > n/2 and y > n/2:
        return int(r(y,x,n,se))

def ringCount(y,x,n):
    yNew = y - ((n/2)-1-ring(y,x,n))
    xNew = x - ((n/2)-1-ring(y,x,n))
    return (int(yNew), int(xNew))

def runningNumber(y,x,p):

    p = (p+1)*2
    if (y,x) == (1,1):
        return 1

    if (y,x) == (p,1):
        return p
    if (y,x) == (p,p):
        return 2*p - 1
    if (y,x) == (1, p):
        return 3*p - 2

    if y == 1:
        return 4*p-2-x
    if y == p:
        return x+p-1
    if x == 1:
        return y
    if x == p:
        return 3*p-1-y
    
def s(n,p):
    return int(4*p*(n-p))

def f(y,x,n):
    k = ringCount(y,x,n)
    g = ring(y,x,n)
    p = runningNumber(k[0],k[1], g)
    d = (n/2)-g-1
    e = s(n, d)
    print(e+p)


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

for i in range(t):
    a, b = input().split()
    y = int(a)
    x = int(b)
    f(y,x,n)

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: WRONG ANSWER