习题6-4(uva-439)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
int vis[10][10];
int ax, ay, bx, by;
const int dirs[8][2] = { {-2,1},{-2,-1},{-1,-2},{-1,2},{1,-2}, {1,2}, {2,-1}, {2,1} };

int main()
{
	string in;
	while (getline(cin, in)) {
		memset(vis, 0, sizeof(vis));
		int cnt = 0,len = 0;
		ax = in[1] - '0';
		ay = in[0] - 'a' + 1;
		bx = in[4] - '0';
		by = in[3] - 'a' + 1;
		queue<int> q;
		q.push(ax); q.push(ay);
		vis[ax][ay] = 1;

		bool isok = false;

		while (!isok && !q.empty()) {
			int len = q.size() / 2;
			
			for (int i = 0; i < len; ++i) {
				int x = q.front(); q.pop();
				int y = q.front(); q.pop();
				
				if (x == bx && y == by) { isok = true; break; }
				for (int j = 0; j < 8; ++j) {
					int nx = x + dirs[j][0];
					int ny = y + dirs[j][1];
					if (nx >= 1 && nx <= 8 && ny >= 1 && ny <= 8 && !vis[nx][ny]) {
						vis[nx][ny] = 1;
						q.push(nx);
						q.push(ny);
					}
				}
			}
			if(isok) break;
			++cnt;
		}
		cout << "To get from " << in[0] << in[1] << " to " << in[3] << in[4] << " takes " << cnt << " knight moves." << endl;
	}
	return 0;
}