Spiraali

#include <iostream>
#include <vector>
#include <set>
#include <map>

using namespace std;

typedef long long ll;

ll left(ll s, ll nc, ll l, ll x2, ll y2)
{
	ll x1 = l + 1, y1 = x1;
	return (s)+((x2 - x1) + (y2 - y1));
};
ll right(ll s, ll nc, ll l, ll x2, ll y2)
{
	ll x1 = l + 1, y1 = x1;
	return (s + nc) - ((x2 - x1) + (y2 - y1));
};
ll getStart(int n, int l)
{
	ll total = 0;
	for (ll i = 0; i < l; ++i)
	{
		total += 4 * (n - (1 + i * 2));
	}
	return total + 1;
}

int main()
{
	std::ios_base::sync_with_stdio(0);
	std::cin.tie(0);
	int n, t;
	std::cin >> n >> t;

	for (int i = 0; i < t; i++)
	{
		int y, x;
		std::cin >> y >> x;
		int l = min(min(y - 1, x - 1), min(n - 1 - (y - 1), n - 1 - (x - 1)));
		int lSize = n - l * 2;
		int nc = 4 * (n - (1 + l * 2));
		ll s = getStart(n, l);
		bool isRight = x - l == lSize || (y == l + 1 && x != l + 1);

		ll res = isRight ? right(s, nc, l, x, y) : left(s, nc, l, x, y);
		printf("%lli\n", res);
		//printf("(%d)%i %i: %i\n", isRight, y, x, res);
	}
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED