CF329B Biridian Forest

难度：4
知识点：广度优先搜索

又是一道偏简单的难度为4的题目，就是裸的广搜，题目给的地图是数字的话，表示这个点的人数，然后题目问的是在你到达终点之前有多少人能到达，包括和你同时到达的，思路就很简单了，从终点开始搜，只要距离小于等于你的距离的，都累加上人数，然后这里dist为了方便判断，可以初始化为无穷大，在搜索的过程种顺道更新dist，不耽误后面用，

#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define mk make_pair
#define sz(x) ((int) x.size())
#define all(x) (x).begin(), (x).end()

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;

const int N = 1005;
const int INF = 100000000;

int n, m, xs, ys, xe, ye;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
string s[N];

void bfs() {
    queue<pa> q;
    q.push(mk(xe, ye));
    int dist[N][N];
    fill((int*) dist, (int*) dist + N * N, INF);
    dist[xe][ye] = 0;
    int ans = 0;
    while (!q.empty()) {
        pa now = q.front(); q.pop();
        if (dist[now.fi][now.se] > dist[xs][ys]) break;
        if (s[now.fi][now.se] > '0' && s[now.fi][now.se] <= '9') ans += s[now.fi][now.se] - '0';
        for (int i = 0; i < 4; i++) {
            int x = now.fi + dx[i], y = now.se + dy[i];
            if (x < 0 || y < 0 || x >= n || y >= m || s[x][y] == 'T' || dist[x][y] < INF) continue;
            q.push(mk(x, y)); dist[x][y] = dist[now.fi][now.se] + 1;
        }
    }
    cout << ans;
}

int main() {
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> s[i];
        for (int j = 0; j < m; j++) {
            if (s[i][j] == 'S') { xs = i; ys = j; s[i][j] = '0'; }
            if (s[i][j] == 'E') { xe = i; ye = j; s[i][j] = '0'; }
        }
    }
    bfs();
    return 0;
}