求助90分第7个点WA了

#include<iostream>
#include<cstring>
using namespace std;
long long a,b,c[53][53],d[53][53],e,f,g[300001],h[300001],m[300001],n[5]={0,-1,1,0,0},o[5]={0,0,0,-1,1},p[300001],head,tail,t1,t2,t3,t4,min_=0x7fffffff;
char t;
int main()
{
    cin>>a>>b;
    for(int i=0;i<a;i++)
    for(int j=0;j<b;j++)
    cin>>c[i][j];
    d[0][0]=c[0][0];
    for(int i=1;i<=max(a,b);i++)
    {
        d[i][0]=max(c[i][0],c[i-1][0]);
        d[0][i]=max(c[0][i],c[0][i-1]);
    }
    for(int i=1;i<=a;i++)
    for(int j=1;j<=b;j++)
    d[i][j]=max(max(c[i][j-1],c[i-1][j]),max(c[i-1][j-1],c[i][j]));
    cin>>g[0]>>h[0]>>e>>f>>t;
    if(t=='N')
    m[0]=1;
    if(t=='S')
    m[0]=2;
    if(t=='W')
    m[0]=3;
    if(t=='E')
    m[0]=4;
    c[g[0]][h[0]]=1;
    memset(c,0,sizeof(c));
    while(head<=tail)
    {
        if(g[head]==e&&h[head]==f)
        {
            cout<<p[head]<<endl;
            return 0;
        }
        for(int i=1;i<5;i++)
        {
            t3=1;
            if(i==m[head])
            t3=0;
            for(int j=1;j<=3;j++)
            {
                t1=g[head]+n[i]*j;
                t2=h[head]+o[i]*j;
                if(!c[t1][t2]&&!d[t1][t2]&&t1>0&&t1<a&&t2>0&&t2<b)
                {
                    tail++;
                    g[tail]=t1;
                    h[tail]=t2;
                    m[tail]=i;
                    p[tail]=p[head]+1+t3;
                    c[t1][t2]=1;
                }
                else
                break;
            }
        }
        head++;
    }
    cout<<-1<<endl;
}