棋盘游戏

#include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
int a[6][6], sx, sy, ex, ey;
int dx[4] = {1, -1, 0, 0}, dy[4] = {0, 0, 1, -1};
bool vis[6][6];
struct node {
    int x, y, sta, cost;
};
queue<node> q;
int bfs() {
    int ans = 0x3f3f3f3f;
    node st = (node) {sx, sy, 1, 0};
    vis[sx][sy] = true;
    q.push(st);
    int nx, ny, dc, ns, nc;
    while(!q.empty()) {
        node now = q.front();
        q.pop();
        if(now.x == ex && now.y == ey) ans = min(ans, now.cost);
        for(int i = 0; i < 4; i++) {
            nx = now.x + dx[i];
            ny = now.y + dy[i];
            if(nx >= 0 && nx <= 5 && ny >= 0 && ny <= 5 && !vis[nx][ny]) {
                dc = now.sta * a[nx][ny];
                nc = now.cost + dc;
                ns = dc % 4 + 1;
                node nex = (node) {nx, ny, ns, nc};
                vis[nx][ny] = true;
                q.push(nex);
            }
        }
    }
    return ans;
}
int main() {
    for(int i = 0; i < 6; i++) {
        for(int j = 0; j < 6; j++) {
            scanf("%d", &a[i][j]);
        }
    }
    scanf("%d%d%d%d", &sx, &sy, &ex, &ey);
    printf("%d", bfs());
    return 0;
}