ZOJ 1091 依然是广搜哒～～

#include <cstring>
#include <iostream>
#include <queue>
using namespace std;

typedef struct node {
int X;
int Y;
int step;
} pos;

queue<pos> Q;
int vist[9][9];

int jump[9][2] = {{0, 0},  {-1, -2}, {-2, -1}, {-2, 1}, {-1, 2},
{1, -2}, {2, -1},  {2, 1},   {1, 2}};

int main(void) {
char x1, x2;
int y1, y2, a, b;
pos r;

pos arr_f_Q[100000];
while (cin >> x1 >> y1 >> x2 >> y2) {
int count = -1;
memset(vist, 0, sizeof(vist));
while (!Q.empty())
Q.pop();

a = x1 - 'a' + 1;
b = x2 - 'a' + 1;

r.X = a;
r.Y = y1;
r.step = 0;
Q.push(r);
while (!Q.empty()) {
count++;
arr_f_Q[count] = Q.front();
Q.pop();
if (arr_f_Q[count].X == b && arr_f_Q[count].Y == y2) {
break;
}

for (int i = 1; i <= 8; i++) {
r.X = arr_f_Q[count].X + jump[i][0];
r.Y = arr_f_Q[count].Y + jump[i][1];

if (r.X >= 1 && r.X <= 8 && r.Y >= 1 && r.Y <= 8 && !vist[r.X][r.Y]) {
vist[r.X][r.Y] = 1;
r.step = arr_f_Q[count].step + 1;
Q.push(r);
}
}
}
cout << "To get from " << x1 << y1 << " to " << x2 << y2 << " takes "
<< arr_f_Q[count].step << " knight moves." << endl;
}

return 0;
}