全部评论 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;
    }
    

    2天前 来自 浙江

    0

热门讨论