poj2243Knight Moves宽搜

#include<stdio.h>

#include<iostream>

#include<string.h>

#include<queue>

#include<stack>

#include<list>

#include<stdlib.h>

#include<algorithm>

#include<vector>

#include<map>

#include<set>

using namespace std;

int dx[]={-2,-1,1,2,-2,-1,1,2};

int dy[]={1,2,2,1,-1,-2,-2,-1};

int vis[10][10];

char str[100],str1[100];

int a,b,c,d;

int dist[10000];

void bfs(int x,int y)

{

    int cc=x*10+y;

    queue<int> q;

    q.push(cc);

    while(!q.empty()){

        int cc=q.front();

        q.pop();

        int xx=cc/10;int yy=cc%10;

        if(xx==c&&yy==d){

            printf("To get from %s to %s takes %d knight moves.\n",str,str1,dist[cc]);

            return ;

        }

        for(int i=0;i<8;i++){

            int x1=xx+dx[i];int y1=yy+dy[i];

            if(x1>=1&&x1<=8&&y1>=1&&y1<=8&&!vis[x1][y1]){

                int k=x1*10+y1;

                dist[k]=dist[cc]+1;

                q.push(k);

                vis[x1][y1]=1;

            }

        }

    }

}

int main()

{

    while(cin>>str>>str1){

        memset(dist,0,sizeof(dist));

        memset(vis,0,sizeof(vis));

        a=str[0]-'a'+1;b=str[1]-'0';

        c=str1[0]-'a'+1;d=str1[1]-'0';

        bfs(a,b);

    }

    return 0;

}