Spiraali

#include <iostream>

using namespace std;

int main(){

    int n, t; cin >> n >> t;
    long long int ns[n+1][n+1] = {0};
    int y, x; y = x = 1;
    char dir = 'd';
    long long int max_dir = n-1, max_left = n-1;
    bool dec = 1;

    for(long long int i = 1; i <= n * n; ++i){
        ns[y][x] = i;
        switch(dir){
            case 'u':
                --y;
                break;
            case 'r':
                ++x;
                break;
            case 'd':
                ++y;
                break;
            case 'l':
                --x;
                break;
        }
        if(i == max_dir){
            max_dir += max_left;
            if(dec){
                dec = 0;
            }
            else{dec = 1;
                --max_left;}
            switch(dir){
                case 'd':
                    dir = 'r';
                    break;
                case 'r':
                    dir = 'u';
                    break;
                case 'u':
                    dir = 'l';
                    break;
                case 'l':
                    dir = 'd';
                    break;

            }


        }

    }
    while(t--){
        cin >> y >> x;
        cout << ns[y][x] << "\n";
    }




return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: RUNTIME ERROR