1.cpp

#include <iostream>
#include <vector>
#include <queue>
#include <tuple>

using namespace std;

const int INF = 1e9 + 7;

bool correct(int x, int y)
{
    return x >= 0 && x < 8 && y >= 0 && y < 8;
}

int main()
{
    string coords1, coords2;
    cin >> coords1 >> coords2;
    int start_x = coords1[0] - 'a', start_y = coords1[1] - '1', finish_x = coords2[0] - 'a', finish_y = coords2[1] - '1';
    vector<int> sides(6);
    for (int i = 0; i < 6; ++i)
        cin >> sides[i];
    int min_count[8][8][6][4];
    tuple<int, int, int, int> parents[8][8][6][4];
    for (int i = 0; i < 8; ++i)
        for (int j = 0; j < 8; ++j)
            for (int k = 0; k < 6; ++k)
                for (int t = 0; t < 4; ++t)
                {
                    min_count[i][j][k][t] = INF;
                    parents[i][j][k][t] = {-1, -1, -1, -1};
                }
    bool visited[8][8][6][4] = {};
    queue<tuple<int, int, int, int>> q;
    for (int d = 0; d < 4; ++d)
    {
        min_count[start_x][start_y][sides[4]][d] = sides[4];
        visited[start_x][start_y][sides[4]][d] = true;
        q.push({start_x, start_y, sides[4], d});
    }
    while (!q.empty())
    {
        int x, y, down, d;
        tie(x, y, down, d) = q.front();
        q.pop();
    }
}