Cod sursă (job #558138)

#include <fstream>

#define NMAX 16

using namespace std;

ifstream f("immortal.in");
ofstream g("immortal.out");

int n, m, players, ended, total;
int a[25][25];

struct Pozitii{
    int x, y;
};
struct Final{
    int x1, y1, x2, y2;
};
Pozitii v[NMAX];
Final out[NMAX];

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};

int check(int line, int col, int dir)
{
    int new_x = line + 2 * dx[dir];
    int new_y = col + 2 * dy[dir];

    if(new_x >= 1 && new_x <= n && new_y >= 1 && new_y <= m)
        if(a[new_x][new_y] == 0 && a[new_x - dx[dir]][new_y - dy[dir]] == 1)
            return 1;
    return 0;
}

void backTrack(int left_in_game)
{
    if(left_in_game == 1)
    {
        for(int i = 1; i < players; i++)
            g << out[i].x1 << " " << out[i].y1 << " " << out[i].x2 << " " << out[i].y2 << "\n";
        ended = 1;
        return;
    }

    for(int i = 1; i <= players; i++)
    {
        if(a[v[i].x][v[i].y] == 1)
        {
            for(int dir = 0; dir < 4; dir++)
            {
                int line = v[i].x;
                int col = v[i].y;

                if(check(line, col, dir))
                {
                    total++;
                    out[total].x1 = line;
                    out[total].y1 = col;
                    out[total].x2 = line + 2 * dx[dir];
                    out[total].y2 = col + 2 * dy[dir];

                    a[line][col] = 0;
                    a[line + dx[dir]][col + dy[dir]] = 0;
                    a[line + 2 * dx[dir]][col + 2 * dy[dir]] = 1;

                    v[i].x += 2 * dx[dir];
                    v[i].y += 2 * dy[dir];

                    backTrack(left_in_game - 1);
                    if(ended)
                        return;

                    total--;
                    v[i].x = line;
                    v[i].y = col;

                    a[line][col] = 1;
                    a[line + dx[dir]][col + dy[dir]] = 1;
                    a[line + 2 * dx[dir]][col + 2 * dy[dir]] = 0;
                }
            }
        }
    }
}

int main()
{
    f >> n >> m >> players;
    for(int i = 1; i <= players; i++)
    {
        f >> v[i].x >> v[i].y;
        a[v[i].x][v[i].y] = 1;
    }

    backTrack(players);
    return 0;
}