Spiraali

#include <iostream>
#include <string>
#include <map>
#include <vector>
#include <algorithm>

#define ll long long

using namespace std;

int gne(int n, int x, int y) {
    vector<int> dists;
    dists.push_back(y);
    dists.push_back(n-y-1);
    dists.push_back(x);
    dists.push_back(n-x-1);

    int m = *min_element(dists.begin(), dists.end());

    return m;
}

int getltop(int n, int l) {
    int res = 1;
    cout << "n: " << n << "\n";
    for(int i = 0; i < l; i++) {
        res += 4*(n-1-2*i);
    }
    return res;
}

int test(int n, int x, int y) {
    int l = gne(n,x,y);
    int ltop = getltop(n,l);

    int llen = n-2*l-1;

    //cout << "l: " << l << "ltop: " << ltop << " llen: " << llen <<"\n";

    if (x == l){
        //cout << "left";
        return ltop + (y - l);
    }

    if ((y-l) == llen) {
        //cout << "bot";
        return ltop + llen + (x-l);
    }

    if ((x-l) == llen) {
        //cout << "right";
        return ltop + 3*llen - (y-l);
    }

    if (y == l) {
        //cout << "top";
        return ltop + 4*llen - (x-l);
    }

    //cout << "FAIL\n";
    return 0;


}

int main() {
    int n, t;
    cin >> n >> t;

    

    for(int i=0; i<t; i++){
        int x, y;
        cin >> x >> y;
        cout << test(n,x,y);
    }

    return 0;

}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED