【HDOJ】2579 Dating with girls(2)

简单BFS。

 /* 2579 */
 #include <iostream>
 #include <queue>
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 using namespace std;
 
 #define MAXN 105
 
 typedef struct node_t {
     int x, y, t;
     node_t() {}
     node_t(int xx, int yy, int tt) {
         x = xx; y = yy; t = tt;
     }
 } node_t;
 
 int n, m, b;
 bool visit[MAXN][MAXN][];
 char map[MAXN][MAXN];
 node_t beg;
 int dir[][] = {
     -,,,,,-,,
 };
 
 inline bool check(int x, int y) {
     return x< || x>=n || y< || y>=m;
 }
 
 int bfs() {
     int i, j, k;
     int x, y, t;
     node_t nd;
     queue<node_t> Q;
 
     memset(visit, false, sizeof(visit));
     visit[beg.x][beg.y][] = true;
     Q.push(beg);
 
     while (!Q.empty()) {
         nd = Q.front();
         Q.pop();
         t = nd.t + ;
         k = t%b;
         for (i=; i<; ++i) {
             x = nd.x + dir[i][];
             y = nd.y + dir[i][];
             if (check(x,y) || visit[x][y][k])
                 continue;
             if (k && map[x][y]=='#')
                 continue;
             if (map[x][y] == 'G')
                 return t;
             visit[x][y][k] = true;
             Q.push(node_t(x, y, t));
         }
     }
 
     return -;
 }
 
 int main() {
     int t;
     int i, j, k;
 
     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
         freopen("data.out", "w", stdout);
     #endif
 
     beg.t = ;
     scanf("%d", &t);
     while (t--) {
         scanf("%d %d %d", &n,&m,&b);
         for (i=; i<n; ++i) {
             scanf("%s", map[i]);
             for (j=; j<m; ++j) {
                 if (map[i][j] == 'Y') {
                     beg.x = i;
                     beg.y = j;
                 }
             }
         }
         k = bfs();
         if (k < )
             puts("Please give me another chance!");
         else
             printf("%d\n", k);
     }
 
     return ;
 }