Spiraali

#include <iostream>
#include <stdio.h>
#include <math.h>
#include <vector>
#include <string>
#include <sstream>
#define lint long long int

lint subSpiral(lint y, lint x, lint n) {
	
	lint dx = std::min(n + 1 - x, x);
	lint dy = std::min(n + 1 - y, y);
	lint depth = std::min(dy, dx);
	lint m = n - (depth-1)*2;
	lint firstValue = -4*depth*depth + (8 + 8 * n/2)*depth - (3 + 8 * n/2);
	lint u = x - (depth-1);
	lint v = y - (depth-1);
	lint value = 1;
	if(v == 1 && u > 1)
	{
		value = firstValue - 1 + m*3-2 + (m-u); 
	}
	else if(u == m)
	{
		value = firstValue - 1 + m*2-1 + (m-v);
	}
	else if(v == m)
	{
		value = firstValue - 1 + m + (u-1);
	}
	else
	{
		value = firstValue - 1 + v;
	}
	return value;
}

int main ()
{
	lint n; std::cin >> n;
	lint t; std::cin >> t;
	std::vector< std::pair<lint,lint> > locs;
	for(int i = 0; i < t; i++) {
		lint y; std::cin >> y;
		lint x; std::cin >> x;
		std::pair<lint, lint> p = std::pair<lint,lint>(y,x);
		locs.push_back(p);
	}
	for(int i = 0; i < t; i++) {
		lint value = subSpiral(locs[i].first, locs[i].second, n);
		std::cout << value << std::endl;
	}
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED