Spiraali

#include <iostream>
using namespace std;

long layer(long n, long x, long y) {
    return min(min(x, n - x - 1), min(y, n - y - 1));
}

long sideLength(long n, long l) {
    return n - l * 2;
}

long solve(long n, long x, long y) {

    long l = layer(n, x, y);
    long s = sideLength(n, l);
    long outside = n*n - s*s;
    s--;

    long result = -2;
    if (x == l && y >= l && y < l + s) {
        result = outside +(y - l) +1;
    } else if (y == l) {
        result = outside -(x - l) +4*s +1;
    } else if (n - x - 1 == l) {
        result = outside -(y - l) +3*s +1;
    } else if (n - y - 1 == l) {
        result = outside +(x - l) +1*s +1;
    }

    return result;
}

int main6() {
    long n = 10;
    for (long y = 0; y < n; y++) {
        for (long x = 0; x < n; x++) {
            cout << "  " << solve(n, x, y);
        }
        cout << "\n";
    }
    return 0;
}

int main() {
    long n, t;
    cin >> n >> t;
    long input [t][2];

    for (int i = 0; i < t; i++) {
        cin >> input[i][1] >> input[i][0];
    }

    for (int i = 0; i < t; i++) {
        cout << solve(n, input[i][0] - 1, input[i][1] - 1) << "\n";
    }

    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED