hdu1242Rescue

http://acm.hdu.edu.cn/showproblem.php?pid=1242

刚开始由于 没标记已走过的 导致RE TLE 纠结了好久 同样纠结为什么正着搜就WA

#include <stdio.h>
#include<string.h>
int n, m,p = 0,q = 0;
char c[201][201];
typedef struct queue
{
    int num, x, y;
}st;
st Q[100001];
void inque(int a, int b)
{
    q++;
    Q[q].x = a;
    Q[q].y = b;
}
int main()
{
    int i,j,r[2],k = 0,mov[2]={-1,1},flag =0;
    while(scanf("%d%d%*c", &n, &m)!=EOF)
    {
        flag = 0;
        memset(Q,0,sizeof(Q[0]));
        for(i = 1 ; i <= n ; i++)
        {
            for(j = 1 ; j <= m ; j++)
            {
                scanf("%c", &c[i][j]);
                if(c[i][j] == 'a')
                {
                    r[0] = i;
                    r[1] = j;
                }
            }
            getchar();
        }
        p = 0;
        q = 1;
        Q[q].x = r[0];
        Q[q].y = r[1];
        Q[q].num = 0;
        do
        {
            p++;
            int x1 = Q[p].x;
            int y1 = Q[p].y;
            for(j = 0 ; j < 2 ; j++)
            {
                if(x1+mov[j]>0&&x1+mov[j]<=n&&(c[x1+mov[j]][y1]=='.'||c[x1+mov[j]][y1]=='x'||c[x1+mov[j]][y1]=='r'))
                {
                    inque(x1+mov[j],y1);
                    if(c[x1+mov[j]][y1]=='x')
                    Q[q].num = Q[p].num+2;
                    else
                    Q[q].num = Q[p].num+1;
                    if(c[x1+mov[j]][y1]=='r')
                    {
                        flag = 1;
                        break;
                    }
                    c[x1+mov[j]][y1] = '#';
                }
                if(y1+mov[j]>0&&y1+mov[j]<=m&&(c[x1][y1+mov[j]]=='.'||c[x1][y1+mov[j]]=='x'||c[x1][y1+mov[j]]=='r'))
                {
                    inque(x1,y1+mov[j]);
                    if(c[x1][y1+mov[j]]=='x')
                    Q[q].num = Q[p].num+2;
                    else
                    Q[q].num = Q[p].num+1;
                    if(c[x1][y1+mov[j]]=='r')
                    {
                        flag = 1;
                        break;
                    }
                    c[x1][y1+mov[j]] = '#';
                }
            }
            if(flag == 1)
            break;
        }while(p!=q);
        if(!flag)
        printf("Poor ANGEL has to stay in the prison all his life.\n");
        else
        {
            printf("%d\n",Q[q].num);
        }
    }
    return 0;
}