Spiraali

#include <iostream>
#include <stdio.h>
#include <math.h>
#include <vector>
#include <string>
#include <sstream>

int subSpiral(int y, int x, int n) {
	int u = std::min(n + 1 - x, x);
	int v = std::min(n + 1 - y, y);
	int depth = std::min(u,v);
	int startValue = 1;
	int endValue = n*4-4;
	int m = n;
	for(int i = 1; i < depth; i++) 
	{
		startValue = endValue + 1;
		endValue = startValue - 1 + ((n-i*2)*4-4);
		m = n-i*2;
	}
	u = x - (depth-1);
	v = y - (depth-1);
	int value = 1;
	if(v == 1 && u > 1)
	{
		value = startValue - 1 + m*3-2 + (m-u); 
	}
	else if(u == m)
	{
		value = startValue - 1 + m*2-1 + (m-v);
	}
	else if(v == m)
	{
		value = startValue - 1 + m + (u-1);
	}
	else
	{
		value = startValue - 1 + v;
	}
	return value;
}

int main ()
{
	int n; std::cin >> n;
	int t; std::cin >> t;
	std::vector< std::pair<int,int> > locs;
	for(int i = 0; i < t; i++) {
		int y; std::cin >> y;
		int x; std::cin >> x;
		std::pair<int, int> p = std::pair<int,int>(y,x);
		locs.push_back(p);
	}
	for(int i = 0; i < t; i++) {
		int 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: TIME LIMIT EXCEEDED