【HDOJ】3345 War Chess

简单BFS。注意最后一组数据，每个初始点不考虑周围是否有敌人。

 /* 3345 */
 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 #include <queue>
 using namespace std;

 #define MAXN 105
 #define INF  0xfffff

 typedef struct node_t {
     int x, y, e;
     node_t() {}
     node_t(int xx, int yy, int ee) {
         x = xx; y = yy; e = ee;
     }
 } node_t;

 char map[MAXN][MAXN];
 bool stop[MAXN][MAXN];
 int hp[MAXN][MAXN];
 int hurt[MAXN][MAXN];
 int n, m, mv;
 int bx, by;
 int dir[][] = {
     -,,,-,,,,
 };

 void init() {
     int i, j, k;

     memset(stop, false, sizeof(stop));
     memset(hurt, -, sizeof(hurt));
     for (i=; i<=n; ++i) {
         for (j=; j<=m; ++j) {
             if (map[i][j] == 'E') {
                 stop[i-][j] = stop[i][j-] = stop[i+][j] = stop[i][j+] = true;
                 hurt[i][j] = INF;
             } else if (map[i][j] == 'Y') {
                 bx = i;
                 by = j;
             } else if (map[i][j] == '.') {
                 hurt[i][j] = ;
             } else if (map[i][j] == 'T') {
                 hurt[i][j] = ;
             } else if (map[i][j] == 'R') {
                 hurt[i][j] = ;
             } else if (map[i][j] == 'P') {
                 hurt[i][j] = ;
             } else if (map[i][j] == '#') {
                 hurt[i][j] = INF;
             }
         }
     }
 }

 bool check(int x, int y) {
     return x<= || x>n || y<= || y>m;
 }

 void bfs() {
     int x, y, e;
     int i, j, k;
     queue<node_t> Q;
     node_t nd;

     memset(hp, -, sizeof(hp));
     //if (stop[bx][by] == false)
         Q.push(node_t(bx,by,mv));
     hp[bx][by] = mv;

     while (!Q.empty()) {
         nd = Q.front();
         Q.pop();

         for (i=; i<; ++i) {
             x = nd.x + dir[i][];
             y = nd.y + dir[i][];
             if (check(x, y))
                 continue;
             e = nd.e - hurt[x][y];
             if (e > hp[x][y]) {
                 hp[x][y] = e;
                 if (stop[x][y] == false)
                     Q.push(node_t(x, y, e));
             }
         }
     }
 }

 void merge() {
     int i, j, k;

     for (i=; i<=n; ++i) {
         for (j=; j<=m; ++j) {
             if (hp[i][j]>= && map[i][j]!='P') {
                 map[i][j] = '*';
             }
         }
     }
     map[bx][by] = 'Y';
 }

 int main() {
     int t;
     int i, j, k;

     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
         freopen("data.out", "w", stdout);
     #endif

     scanf("%d", &t);
     while (t--) {
         scanf("%d %d %d", &n, &m, &mv);
         for (i=; i<=n; ++i)
             scanf("%s", map[i]+);
         init();
         bfs();
         merge();
         for (i=; i<=n; ++i)
             printf("%s\n", map[i]+);
         printf("\n");
     }

     return ;
 }