例题6-14(uva-816)

#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;
const int ROW = 11, COL = 11, DIR = 4;
const int dirs[4][2] = { {-1,0},{0,1},{1,0},{0,-1} };
map<char, char> mmp = { {'N',0},{'E',1} ,{'S',2},{'W',3},{'L',1},{'R',2},{'F',4} };

int matrix[ROW][COL][DIR],dir[ROW][COL][DIR], xStart, yStart, xEnd, yEnd;
char sDir;

vector<pair<int, int> > result;

void AddEdge(int x, int y) {
	string dir;
	while (cin >> dir && dir != "*") {
		int d = mmp[dir.front()];
		for (int i = 1; i < dir.size(); ++i) {
			matrix[x][y][d] |=  mmp[dir[i]];
		}
	}
}

struct Node {
	int x, y, dir;
	Node() :x(), y(), dir() {}
	Node(int a, int b, int c) :x(a), y(b), dir(c) {}
};
Node pre[ROW][COL][DIR];

Node Turn(Node& in, int flag) {
	int dir = in.dir;
	//左转
	if (flag & (1 << 0)) dir = (dir + 3) % 4;
	//右转
	if (flag & (1 << 1)) dir = (dir + 1) % 4;

	return Node(in.x + dirs[dir][0], in.y +  dirs[dir][1], dir);
}
void Print(Node son) {

	while (true) {
		result.emplace_back(make_pair(son.x, son.y));
		if (dir[son.x][son.y][son.dir] == 0) break;
		son = pre[son.x][son.y][son.dir];
	}
	reverse(result.begin(), result.end());
}
bool bfs() {
	queue<Node> q;
	q.push(Node(xStart,yStart, mmp[sDir]));

	dir[xStart][yStart][mmp[sDir]] = 0;

	while (!q.empty()) {
		Node t = q.front(); q.pop();
		if (t.x == xEnd && t.y == yEnd) {
			Print(t);
			return true;
		}
		for (int i = 0; i < 3; ++i) {
			//左 右 直行
			Node v = Turn(t, 1 << i);
			if ((matrix[t.x][t.y][t.dir] & (1 << i)) && v.x >= 1 && v.x <= 9 && v.y >= 1 && v.y <= 9 && dir[v.x][v.y][v.dir] < 0) {
				dir[v.x][v.y][v.dir] = dir[t.x][t.y][t.dir] + 1;
				//保存上一个访问的节点
				pre[v.x][v.y][v.dir] = t;
				q.push(v);
			}
		}
	}
	cout << "  No Solution Possible" << endl;
	return false;
}
int main() {
	string name;
	int x, y,td;
	vector<pair<int, int> > temp;

	while (cin >> name && name != "END") {

		result.clear(); temp.clear();
		memset(matrix, 0, sizeof(matrix));
		memset(dir, -1, sizeof(dir));

		cin >> xStart >> yStart >> sDir >> xEnd >> yEnd;
		while (cin >> x && x) {
			cin >> y;
			AddEdge(x, y);
		}
		
		td = mmp[sDir];
		//第一步是直行
		matrix[xStart][yStart][td] = 4;

		cout << name << endl;
		
		if (bfs())
		{
			cout << " ";
			for (int i = 0; i < result.size(); ++i) {
				if (i && i % 10 == 0) cout << endl << " ";
				cout << " "<<"(" << result[i].first << "," << result[i].second << ")";
			}
			cout << endl;
		}
	}
	
	return 0;
}