Spiraali

#include <iostream>

using namespace std;
using ll = long long;

ll solve(ll n, ll y, ll x);

int main()
{
	ll n, t;
	cin >> n >> t;
	while (t --> 0) {
		ll y, x;
		cin >> y >> x;
		cout << solve(n, y-1, x-1) << "\n";
	}
}

ll solve(ll n, ll y, ll x)
{
	ll d = min(min(y, n-1-y), min(x, n-1-x));
	if (d > 0) {
		return n*n - (n-2*d)*(n-2*d) + solve(n-2*d, y-d, x-d);
	}
	if (x == 0) {
		return y+1;
	}
	if (y == n-1) {
		return n-1 + x+1;
	}
	if (x == n-1) {
		return 2*(n-1) + n-1-y+1;
	}
	if (y == 0) {
		return 3*(n-1) + n-1-x+1;
	}
	cout << "SOS\n";
	return -1e9;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED