Spiraali

input/code.cpp: In function 'int main()':
input/code.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &t);
     ~~~~~^~~~~~~~~~~~~~~~~
input/code.cpp:13:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &y, &x);
         ~~~~~^~~~~~~~~~~~~~~~~

#include <stdio.h>

int main()
{
    int findsec(int, int, int);
    int n, t, x, y, z, sec;

    scanf("%d %d", &n, &t);
    int lista[t];

    for (int i = 0; i < t; i++)
    {
        scanf("%d %d", &y, &x);
        // Program start
        sec = findsec(x, y, n);
        z = n * n - (2 * sec + 2) * (2 * sec + 2);

        if (x == n / 2 - sec)
        {
            z += y - (n / 2 - 1 - sec);
        }
        else if (y == n / 2 + 1 + sec)
        {
            z += 2 * (sec + 1) - 1 + x - (n / 2 - 1 - sec);
        }
        else if (x == n / 2 + 1 + sec)
        {
            z += 2 * (2 * (sec + 1) - 1) + (n / 2 + 2 + sec) - y;
        }
        else if (y == n / 2 - sec)
        {
            z += 3 * (2 * (sec + 1) - 1) + (n / 2 + 2 + sec) - x;
        }

        lista[i] = z;
    }
    for (int i = 0; i < t; i++)
    {
        printf("%d\n", lista[i]);
    }
}

int findsec(int x, int y, int n) // Sektori on etäisyyden mukaan määräytyvä rengasmainen alue
{
    for (int i = 0; i < n / 2; i++)
    {
        if (n / 2 - i <= x && x <= n / 2 + 1 + i && n / 2 - i <= y && y <= n / 2 + 1 + i)
        {
            return i;
        }
    }
    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED