Spiraali

def a(k, n):
	return n ** 2 - (n - 2 * k) ** 2 + 1



def distance_from_edge(x, y, n):
	return min(
		x,
		y,
		n - x - 1,
		n - y - 1
	)

def number_at(x, y, n):
	d = distance_from_edge(x, y, n)
	nn = a(d, n)
	
	if x == y == d:
		return nn
	
	bottom_left = nn + (n - 2 * d) - 1
	if x == d and nn < bottom_left:
		return nn + (y - d)
		
	bottom_right = bottom_left + (n - 2 * d) - 1
	if n - y - 1 == d and nn < bottom_right:
		return bottom_left + (x - d)
		
	top_right = bottom_right + (n - 2 * d) - 1
	if n - x - 1 == d and nn < top_right:
		return bottom_right + (n - d) - y - 1

	top_left = top_right + (n - 2 * d) - 2
	if y == d and nn < top_left:
		return top_right + (n - d) - x - 1
	

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

for i in range(t):
	y, x = map(int, input().split())
	print(number_at(x - 1, y - 1, n))

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED