BFS Codeforces Beta Round #94 (Div. 2 Only) C. Statues

题目传送门

 /*
     BFS：三维BFS，坐标再加上步数，能走一个点当这个地方在步数内不能落到。因为雕像最多8步就会全部下落，
         只要撑过这个时间就能win，否则lose
 */
 #include <cstdio>
 #include <algorithm>
 #include <queue>
 #include <vector>
 #include <cstring>
 using namespace std;

 const int MAXN = ;
 const int INF = 0x3f3f3f3f;
 struct Point{
     int x, y, step;
 };
 char maze[MAXN][MAXN];
 bool vis[MAXN][MAXN][MAXN];
 int n;

 bool check(int x, int y, int s)    {
     if (x >=  && x <=  && y >=  && y <=  && maze[x-s][y] != 'S')   return true;
     return false;
 }

 bool BFS(void)  {
     queue<Point> Q;   Q.push ((Point) {, , });
     memset (vis, false, sizeof (vis));

     while (!Q.empty ()) {
         int x = Q.front ().x, y = Q.front ().y, s = Q.front ().step;    Q.pop ();

         if (s > )  return true;
         if (maze[x-s][y] == 'S')    continue;

         for (int i=-; i<=; ++i)   {
             for (int j=-; j<=; ++j)   {
                 int tx = x + i; int ty = y + j;
                 if (!check (tx, ty, s))    continue;
                 if (!vis[tx][ty][s+])  {
                     vis[tx][ty][s+] = true;
                     Q.push ((Point) {tx, ty, s + });
                 }
             }
         }
     }

     return false;
 }

 int main(void)  {       //Codeforces Beta Round #94 (Div. 2 Only) C. Statues
     //freopen ("B.in", "r", stdin);

     n = ;
     while (scanf ("%s", maze[] + ) == )  {
         for (int i=; i<=n; ++i)    {
             scanf ("%s", maze[i] + );
         }

         if (BFS ()) puts ("WIN");
         else    puts ("LOSE");
     }

     return ;
 }