Spiraali

input/code.cpp: In function 'int main()':
input/code.cpp:45:1: warning: label 'next' defined but not used [-Wunused-label]
 next:
 ^~~~
input/code.cpp:9:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld", &n, &t);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~
input/code.cpp:13:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld", &y, &x);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main()
{
	long long n, t, sum;
	scanf("%lld %lld", &n, &t);
	for(int i = 0; i < t; ++i)
	{
		long long y, x, a;
		scanf("%lld %lld", &y, &x);
		long long tox = min(n+1-x, n+1-y);
		long long minxy = min(x, y);
		long long sep = min(tox,minxy);
		sum = n*n-((n-2*(sep-1))*(n-2*(sep-1)))+1;
		long long xdiff = x-sep;
		long long ydiff = y-sep;
		long long sidelength = n-(2*(sep-1));
		//printf("Xdiff: %d, Ydiff: %d, SL: %d\n", xdiff, ydiff, sidelength);
		if(ydiff == 0 && xdiff != 0)
		{
			a = sum+3*(sidelength-1)+(sidelength-1-xdiff);
		}
		else if(ydiff != 0 && xdiff == 0)
		{
			a = sum+ydiff;
		}
		else if(ydiff != 0 && xdiff != 0)
		{
			if(xdiff == sidelength-1)
			{
				a = sum+2*xdiff+(sidelength-1-ydiff);
			}
			else
			{
				a = sum+ydiff+xdiff;
			}
		}
		else
		{
			a = sum;
		}
next:
		printf("%lld\n", a);
	}
	return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED