Spiraali

#include <iostream>
#include <cmath>

using namespace std;

struct Point
{
    long long x, y;
};

void get_input(Point points[], long long t)
{
    long long x, y;
    for (long long i = 0; i < t; i++)
    {
        cin >> y >> x;
        points[i] = Point{x, y};
    }
}

long long segment(long long l, long long c, long long x, long long y)
{
    return l * l + (c * (l + 1u) - 1u) + x + y;
}

long long get_result(long long n, Point point)
{
    long long m = (n >> 1); // n / 2
    long long x = point.x, y = point.y;

    long long l; // Kerroksen sisäpuolelle jäävän palikan halkaisija
    long long r; // vastaus = n^2 - r;
                 // r on ruudun numero, jos spiraali alkaisi keskeltä 0:lla.
    if (y <= m)
    {
        if (x <= m)
        {
            if (x > y)
            {
                l = 2 * (m - y);
                r = segment(l, 0u, x, -y);
            }
            else
            {
                l = 2 * (m - x);
                r = segment(l, 4u, -y, x);
            }
        }
        else
        {
            if (n - x >= y)
            {
                l = 2 * (m - y);
                r = segment(l, 0u, x, -y);
            }
            else
            {
                l = 2 * (x - m - 1);
                r = segment(l, 2u, y, -x);
            }
        }
    }
    else
    {
        if (x > m)
        {
            if (x < y)
            {
                l = 2 * (y - m - 1);
                r = segment(l, 2u, -x, y);
            }
            else
            {
                l = 2 * (x - m - 1);
                r = segment(l, 2u, y, -x);
            }
        }
        else
        {
            if (x > n - y)
            {
                l = 2 * (y - m - 1);
                r = segment(l, 2u, -x, y);
            }
            else
            {
                l = 2 * (m - x);
                r = segment(l, 4u, -y, x);
            }
        }
    }
    return n * n - r;
}

void get_results(long long results[], int n, Point points[], int t)
{
    for (int i = 0; i < t; i++)
        results[i] = get_result(n, points[i]);
}

void print_results(long long results[], int t)
{
    for (int i = 0; i < t; i++)
        cout << results[i] << "\n";
}

int main()
{
    int n;
    int t;
    cin >> n >> t;
    Point points[t];
    get_input(points, t);
    long long results[t];
    get_results(results, n, points, t);
    print_results(results, t);
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED