【HDOJ】1175 连连看

BFS。wa了一下午，原来是YES，写成了Yes。

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <queue>
 using namespace std;

 typedef struct node_st{
     int x, y;
     int dir;
     int turn;
     node_st() {}
     node_st(int xx, int yy, int ddir, int tturn) {
         x = xx; y = yy; dir = ddir; turn = tturn;
     }
 } node_st;

 int map[][];
 int n, m;
 int dirs[][] = {{,},{,-},{,},{-,}};
 char turns[][];

 bool bfs(int bx, int by, int ex, int ey) {
     queue<node_st> que;
     bool val = false;
     node_st node;
     int x, y, dir, turn;

     memset(turns, , sizeof(turns));
     turns[bx][by] = ;
     que.push(node_st(bx, by, -, ));

     while ( !que.empty() ) {
         node = que.front();
         //printf("x=%d, y=%d, dir=%d, turn=%d\n", node.x, node.y, node.dir, node.turn);
         if (node.x == ex && node.y == ey) {
             val = true;
             break;
         }
         que.pop();
         for (int i=; i<; ++i) {
             x = node.x + dirs[i][];
             y = node.y + dirs[i][];
             dir = i;
             turn = node.turn;
             if (x< || x>n || y< || y>m)
                 continue;
             if (map[x][y] && (x!=ex || y!=ey))
                 continue;
             if (dir!=node.dir && node.dir!=-)
                 ++turn;
             //printf("\tx=%d, y=%d, dir=%d, turn=%d\n", x, y, dir, turn);
             if (turn > )
                 continue;
             if (turns[x][y]== || turn+ <= turns[x][y]) {
                 turns[x][y] = turn+;
                 que.push(node_st(x, y, dir, turn));
             }
         }
     }

     return val;
 }

 int main() {
     int q, x1, x2, y1, y2;
     int i, j;

     while (scanf("%d %d", &n, &m)!=EOF && (n||m)) {
         for (i=; i<=n; ++i)
             for (j=; j<=m; ++j)
                 scanf("%d", &map[i][j]);
         scanf("%d", &q);
         while (q--) {
             scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
             if (x1==x2 && y1==y2) {
                 printf("NO\n");
                 continue;
             }
             if (map[x1][y1]!=map[x2][y2] || map[x1][y1]== || map[x2][y2]==) {
                 printf("NO\n");
                 continue;
             }
             if ( bfs(x1, y1, x2, y2) )
                 printf("YES\n");
             else
                 printf("NO\n");
         }
     }

     return ;
 }