Spiraali

#include <iostream>
#include <string> 
#include <vector>

using namespace std;


int main() {
    int n, t;
    vector<int> xs, ys;

    cin >> n >> t;

    int x, y, k, p;
    for (int i=0; i<t; i++) {
        cin >> y >> x;
        // the 'shell' on which the point lies
        k = min(min(x,n+1-x), min(y,n+1-y));
        
        p = n*n - (n-2*(k-1))*(n-2*(k-1)) + 1;
        // dx
        p += (y == k && x != k) ? 2*(n-2*(k-1)-1) - (x - k): x - k;
        // dy
        p += (x == n+1-k || (y==k && x != k)) ? 2*(n-2*(k-1)-1) - (y - k) : y - k;
        cout << p << "\n";
        
    }


}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: WRONG ANSWER