为什么会错?
原题链接:7992.迷宫之最少花费时间2025-09-06 14:09:34
发布于:江西
#include <bits/stdc++.h>
using namespace std;
char a[105][105];
int vis[105][105];
int sx, sy, ex, ey, t = 1e9, n, m;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
void dfs(int x, int y, int val) {
    if(x == ex && y == ey) {
        if (val < t) t = val;
        return;
    }
    vis[x][y] = 1;
    for (int i = 0; i < 4; i++) {
        int nx = x + dx[i];
        int ny = y + dy[i];
        if (nx >= 0 && nx < n && ny >= 0 && ny < m && !vis[nx][ny]) {
            if (a[nx][ny] == '.') dfs(nx, ny, val + 1);
            else if (a[nx][ny] >= '1' && a[nx][ny] <= '9') 
                dfs(nx, ny, val + (a[nx][ny] - '0') + 1);
        }
    }
    vis[x][y] = 0;
}
int main() {
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> a[i][j];
            if (a[i][j] == 'Z') {
                sx = i; sy = j;
            } else if (a[i][j] == 'W') {
                ex = i; ey = j;
            }
        }
    }
    dfs(sx, sy, 0);
    if (t == 1e9) cout << "IMPOSSIBLE";
    else cout << t;
    return 0;
}
全部评论 1
女娲,浪费了我好久:
#include <bits/stdc++.h> using namespace std; char a[30][30]; int vis[30][30]; int sx, sy, ex, ey, t = 1e9, n, m; int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; void dfs(int x, int y, int val) { if(x == ex && y == ey) { if (val < t) t = val; return; } vis[x][y] = 1; for (int i = 0; i < 4; i++) { int nx = x + dx[i]; int ny = y + dy[i]; if (nx >=1 && nx <= n && ny >= 1 && ny <= m && !vis[nx][ny] && a[nx][ny]!='#') { if(a[nx][ny] >= '1' && a[nx][ny] <= '9') dfs(nx, ny, val+a[nx][ny] - '0'+1); else dfs(nx, ny, val + 1); } } vis[x][y] = 0; } int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; if (a[i][j] == 'Z') { sx = i; sy = j; }if (a[i][j] == 'W') { ex = i; ey = j; } } } dfs(sx, sy, 0); if (t == 1e9) cout << "IMPOSSIBLE"; else cout << t; return 0; }2025-09-06 来自 浙江
1












有帮助,赞一个