Spiraali

#include <math.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;

int k(int x, int y, int n);

int main()
{
	int n, t, x, y, i;
	vector<long long> v;
	cin >> n >> t;

	for (i = 0; i < t; i++) {
		cin >> x >> y;
		v.push_back(k(x, y, n));
	}

	for (auto i : v)
	{
		cout << i << "\n";
	}
}

int k(int x, int y, int n) {
	if (x < y) {
		int k = n - x + 1;
		if (y < k) {
			long long l = 0;
			for (int i = 0; i < x - 1; i++) l += 4 * (n - 2 * i) - 4;
			for (int i = 0; i < 3; i++) l += n - 2 * (x - 1) - 1;
			l += y - x;
			return l;
		}
		else
		{
			k = n - y;
			long long l = 0;
			for (int i = 0; i < k; i++) l += 4 * (n - 2 * i) - 4;
			for (int i = 0; i < 2; i++) l += n - 2 * k;
			l += y - x - 1;
			return l;
		}
	}
	else if (x == y) {
		if (x < n / 2 + 1)
		{
			long long l = 0;
			for (int i = 0; i < x - 1; i++) l += 4 * (n - 2 * i) - 4;
			l += 1;
			if (l > pow(n, 2)) l -= 1;
			return l;
		}
		else
		{
			int k = n - x;
			long long l = 0;
			for (int i = 0; i < k; i++) l += 4 * (n - 2 * i) - 4;
			for (int i = 0; i < 2; i++) l += n - 2 * k;
			return l - 1;
		}
	}
	else 
	{
		int k = n - y + 1;
		if (x <= k) {
			long long l = 0;
			for (int i = 0; i < y - 1; i++) l += 4 * (n - 2 * i) - 4;
			l += x - y + 1;
			return l;
		}
		else
		{
			k = n - x;
			long long l = 0;
			for (int i = 0; i < k; i++) l += 4 * (n - 2 * i) - 4;
			for (int i = 0; i < 1; i++) l += n - 2 * k;
			l += x - y - 1;
			return l;
		}
	}
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED