为什么答案一样却是WA了9个点（第二个点AC）

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<sstream>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
using namespace std;
int n,m,nx,ny,t[2000][2000],uex[10000000],uey[10000000],uez[10000000],l=1,r=1,x,y;
int main()
{
    cin>>n>>m>>nx>>ny;
    uex[1]=nx;
    uey[1]=ny;
    for(x=1;x<=n;++x)
        for(y=1;y<=m;++y)
            t[x][y]=-1;
    t[nx][ny]=0;
    for(;l<=r;++l)
    {
    	if(uex[l]+1<=n&&uey[l]+2<=m&&(t[uex[l]+1][uey[l]+2]>uez[l]+1||t[uex[l]+1][uey[l]+2]==-1))
    		t[uex[++r]=uex[l]+1][uey[r]=uey[l]+2]=uez[r]=uez[l]+1;
        if(uex[l]+2<=n&&uey[l]+1<=m&&(t[uex[l]+2][uey[l]+1]>uez[l]+1||t[uex[l]+2][uey[l]+1]==-1))
    		t[uex[++r]=uex[l]+2][uey[r]=uey[l]+1]=uez[r]=uez[l]+1;
        if(uex[l]+1<=n&&uey[l]-2>0&&(t[uex[l]+1][uey[l]-2]>uez[l]+1||t[uex[l]+1][uey[l]-2]==-1))
    		t[uex[++r]=uex[l]+1][uey[r]=uey[l]-2]=uez[r]=uez[l]+1;
        if(uex[l]+2<=n&&uey[l]-1>0&&(t[uex[l]+2][uey[l]-1]>uez[l]+1||t[uex[l]+2][uey[l]-1]==-1))
    		t[uex[++r]=uex[l]+2][uey[r]=uey[l]-1]=uez[r]=uez[l]+1;
        if(uex[l]-1>0&&uey[l]+2<=m&&(t[uex[l]-1][uey[l]+2]>uez[l]+1||t[uex[l]-1][uey[l]+2]==-1))
    		t[uex[++r]=uex[l]-1][uey[r]=uey[l]+2]=uez[r]=uez[l]+1;
        if(uex[l]-2>0&&uey[l]+1<=m&&(t[uex[l]-2][uey[l]+1]>uez[l]+1||t[uex[l]-2][uey[l]+1]==-1))
    		t[uex[++r]=uex[l]-2][uey[r]=uey[l]+1]=uez[r]=uez[l]+1;
        if(uex[l]-1>0&&uey[l]-2>0&&(t[uex[l]-1][uey[l]-2]>uez[l]+1||t[uex[l]-1][uey[l]-2]==-1))
    		t[uex[++r]=uex[l]-1][uey[r]=uey[l]-2]=uez[r]=uez[l]+1;
        if(uex[l]-2>0&&uey[l]-1>0&&(t[uex[l]-2][uey[l]-1]>uez[l]+1||t[uex[l]-2][uey[l]-1]==-1))
    		t[uex[++r]=uex[l]-2][uey[r]=uey[l]-1]=uez[r]=uez[l]+1;
    }
    for(x=1;x<=n;++x,cout<<endl)
        for(y=1;y<=m;++y)
            printf("%-5d",t[x][y]);
    return 0;
}