马走日最小步数

样例输入

2
5 1 1 2 3
5 1 1 2 2

样例输出

Case #1: 1

Case #2: 4

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
const int maxn = 200;
int vis[maxn][maxn];
int dir[][2] = {1, 2, 1, -2, 2, 1, 2, -1, -1, 2, -1, -2, -2, 1, -2, -1};
int main()
{
    int x, y,t,p;
    int m, n,ans=0;
    int flag;
    cin>>p;
    for(int ss=1;ss<=p;ss++)
    {
        cin>>t;
        scanf("%d%d%d%d",&x, &y, &m, &n);
        ans=0;
    memset(vis, 0, sizeof(vis));
    flag = 0;
    pair<int, int> pa;
    queue<pair<int, int> > q;
    pa.first = x;
    pa.second = y;
    q.push(pa);
    if(x==m&&y==n)ans=-1;
    else
    {
        while(!q.empty())
    {
        if(flag) break;
        pair<int, int> pb;
        pb = q.front();
        q.pop();
            for(int i = 0; i < 8; ++i)
            {
                pa.first = pb.first + dir[i][0];
                pa.second = pb.second + dir[i][1];
                if(pa.first < 1 || pa.first > t || pa.second < 1 || pa.second > t)
                    continue;
                if(vis[pa.first][pa.second]) continue;
                if(pa.first == m && pa.second == n)
                {
                    flag = 1;
                    ans=vis[pb.first][pb.second];
                    break;
                }
                vis[pa.first][pa.second] = vis[pb.first][pb.second] + 1;
                q.push(pa);
            }
    }
    }

    cout<<"Case #"<<ss<<": "<<ans+1<<endl;
        cout<<endl;
    }

    return 0;
}