棋盘（DFS)

题目地址：
棋盘洛谷传送门
棋盘计蒜客传送门

原文地址：
原文传送门
上代码喽：

#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
#define inf 0x7fffffff
int fx[4] = { -1, 0, 1, 0 };
int fy[4] = { 0, -1, 0, 1 };
int f[110][110];
int mp[110][110];
int m, n, ans = inf;
void dfs(int x, int y, int sum, bool frog) {
    if (x < 1 || y < 1 || x > m || y > m)
        return;
    if (sum >= f[x][y])
        return;

    f[x][y] = sum;
    if (x == m && y == m) {
        if (sum < ans)
            ans = sum;
        return;
    }
    for (int i = 0; i < 4; ++i) {
        int xx = x + fx[i];
        int yy = y + fy[i];
        if (mp[xx][yy]) {
            if (mp[xx][yy] == mp[x][y])
                dfs(xx, yy, sum, false);
            else
                dfs(xx, yy, sum + 1, false);
        } else if (!frog) {
            mp[xx][yy] = mp[x][y];
            dfs(xx, yy, sum + 2, true);
            mp[xx][yy] = 0;
        }
    }
}
int main() {
    freopen("board.in", "r", stdin);
    freopen("board.out", "w", stdout);
    memset(f, 0x7f, sizeof(f));
    scanf("%d %d", &m, &n);
    for (int i = 1; i <= n; ++i) {
        int x, y, c;
        scanf("%d %d %d", &x, &y, &c);
        mp[x][y] = c + 1;
    }
    dfs(1, 1, 0, false);
    printf("%d", ans == inf ? -1 : ans);
    return 0;
}