【习题 6-4 UVA-439】Knight Moves

【链接】 我是链接,点我呀:)
【题意】

在这里输入题意

【题解】

bfs模板题

【代码】

/*
    1.Shoud it use long long ?
    2.Have you ever test several sample(at least therr) yourself?
    3.Can you promise that the solution is right? At least,the main ideal
    4.use the puts("") or putchar() or printf and such things?
    5.init the used array or any value?
    6.use error MAX_VALUE?
    7.use scanf instead of cin/cout?
*/
#include <bits/stdc++.h>
using namespace std;
#define y1 stupid_gcc
#define x1 stupid_gcc2

const int N = 8;

string s1,s2;
int x1,y1,x2,y2;
int dx[8] = {1,2,2,1,-1,-2,-2,-1};
int dy[8] = {-2,-1,1,2,-2,-1,1,2};

int bo[N+5][N+5];
queue <pair<int,int> > dl;

int main(){
    #ifdef LOCAL_DEFINE
        freopen("F:\\c++source\\rush_in.txt", "r", stdin);
    #endif
    ios::sync_with_stdio(0),cin.tie(0);
    while (cin >> s1 >> s2){
        x1 = s1[1]-'0',y1 = s1[0]-'a'+1;
        x2 = s2[1]-'0',y2 = s2[0]-'a'+1;
        memset(bo,255,sizeof bo);
        bo[x1][y1] = 0;
        dl.push(make_pair(x1,y1));
        while (!dl.empty()){
            int x = dl.front().first,y = dl.front().second;
            dl.pop();
            for (int i = 0;i < 8;i++){
                int x1 = x + dx[i],y1 = y + dy[i];
                if (x1 >= 1 && x1 <= 8 && y1<= 8 && y1 >=1 && bo[x1][y1]==-1){
                    bo[x1][y1] = bo[x][y]+1;
                    dl.push(make_pair(x1,y1));
                }
            }           
        }   
        cout << "To get from "<<s1<<" to "<<s2<<" takes " <<bo[x2][y2] << " knight moves."<<endl;
    }
    return 0;
}

转载于:https://www.cnblogs.com/AWCXV/p/7875220.html