Spiraali

#include <bits/stdc++.h>

typedef long long ll;

#define M 1000000007
#define N (1 << 18)

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n, t;
    cin >> n >> t;
    for (int i = 0; i < t; ++i) {
        ll x, y;
        cin >> y >> x;

        ll ans = 0;

        ll outside = min(min(x - 1, n - x), min(y - 1, n - y));

        ll size = n;
        for (int it = 0; it < outside; ++it) {
            ans += size * 4 - 4;
            size -= 2;
        }

        if (x == outside + 1) {
            // Going down
            ans += y - outside; 
        } else if (x < n - outside) {
            // In the middle. 

            // Left downwards
            ans += n - outside * 2;

            // Traveling above
            if (y <= n / 2) {
                // Lower part - left corner
                ans += n - outside * 2 - 1;
                // Right part - right down corner
                ans += n - outside * 2 - 1;
                // Going from left
                ans += n - x - outside;
            } else {
                // Traveling below
                ans += x - outside;
            }
        } else {
            // Right going up
            // Left
            ans += n - outside * 2;
            // Lower part - left down corner
            ans += n - outside * 2 - 1;
            // up part
            ans += n - y - outside;
        }

        cout << ans << "\n";
    }   

    return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED