第二个BFs HDU1242

这个题好纠结，通过C++提交无限次RE，可是用g++提交一次就AC了，

怎么这些极品问题都是在我身上发生，无语了，上次是系统错误，这次是编译器漏洞。。。。。。

#include<stdio.h>
#include<string.h>
#define Maxsize 10000
typedef struct 
{
int x;
int y;
}position;
typedef struct
{
int tail,head;
position a[Maxsize];
}queue;
void create(queue&);
void enqueue(position,queue &);
position dequeue(queue &);
int empty(queue);
char maze[202][202];
int flag[202][202];
int bfs(int ,int );
int main()
{
int r,c,i,k;
while(scanf("%d %d",&r,&c)!=EOF)
{
for(i=1;i<=r;i++)
scanf("%s",&maze[i][1]);
k=bfs(r,c);
if(k!=-1)  printf("%d\n",k);
else
printf("Poor ANGEL has to stay in the prison all his life.\n");
}
return 0;
}
int bfs(int r,int c)
{
memset(flag,0,sizeof(flag));
void wall(int ,int );
void finden(int ,int ,position&,position& );
queue q;
position enter,now,next,exit;
position move[4]={-1,0,0,1,1,0,0,-1};
create(q);
wall(r,c);
int i;
finden(r,c,enter,exit);
enqueue(enter,q);
flag[enter.x][enter.y]=1;
while(!empty(q))
{
now=dequeue(q);
for(i=0;i<=3;i++)
{
next.x=now.x+move[i].x;
next.y=now.y+move[i].y;
if(maze[next.x][next.y]!='#'&&(!flag[next.x][next.y]||flag[next.x][next.y]>flag[now.x][now.y]+1))
{
flag[next.x][next.y]=flag[now.x][now.y]+1;
if(maze[next.x][next.y]=='x')
flag[next.x][next.y]++;
if(maze[next.x][next.y]!='a')
enqueue(next,q);
}
}
}
return flag[exit.x][exit.y]-1;
}
void create(queue &q)
{
q.head=q.tail=0;
}
void enqueue(position p,queue &q)
{
q.a[q.tail]=p;
q.tail=(q.tail+1)%Maxsize;
}
position dequeue(queue &q)
{
position p;
p=q.a[q.head];
q.head=(q.head+1)%Maxsize;
return p;
}
int empty(queue q)
{
if(q.head==q.tail) return 1;
else return 0;
}
void wall(int r,int c)
{
int i;
for(i=0;i<=r+1;i++)
{
maze[i][0]='#';
maze[i][c+1]='#';
}
for(i=0;i<=c+1;i++)
{
maze[0][i]='#';
maze[r+1][i]='#';
}
}
void finden(int r,int c,position &enter,position &exit)
{
int i,j;
for(i=1;i<=r;i++)
for(j=1;j<=c;j++)
{
if(maze[i][j]=='r')
{
enter.x=i;
enter.y=j;
}
if(maze[i][j]=='a')
{
exit.x=i;
exit.y=j;
}
}
}