习题 7-2 黄金图形（Golygons，ACM/ICPC World Finals 1993，UVa225）

原题链接：https://vjudge.net/problem/UVA-225
分类：回溯法
备注：注意细节，DFS

题意：每条路径不可在同一点重复驻留，路障在你要走的路中，那么这条路是不可以走的，注意vis数组的检测，要留心别把刚刚就走过的点还放到检测列表中，踏踏实实分类讨论。

代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int dir[4][2] = { {0,1},{0,-1},{ 1,0},{-1,0} };//n s e w 字典序ensw
const char toAlpha[4] = { 'n','s','e','w' };
const int order[4] = { 2,0,1,3 };
const int base = 120;
int t, n, m, cnt, ans[25], du[base * 2][base * 2], vis[base * 2][base * 2];
void dfs(int x, int y, int step, int to) {
	if (step == n + 1) {
		if (x == base && y == base) {
			for (int i = 1; i <= n; i++)
				printf("%c", toAlpha[ans[i]]);
			printf("\n");
			cnt++;
		}
		return;
	}
	if (to == 0 || to == 1) {//动x轴
		for (int i = 2; i < 4; i++) {
			int tx = x + dir[i][0] * step;
			bool flag = false;
			if (tx > x) {
				for (int k = x + 1; k <= tx; k++)
					if (du[k][y]) {
						flag = true;
						break;
					}
			}
			else {
				for (int k = tx; k < x; k++)
					if (du[k][y]) {
						flag = true;
						break;
					}
			}
			if (flag || vis[tx][y])continue;
			ans[step] = i;
			vis[tx][y] = true;
			dfs(tx, y, step + 1, i);
			vis[tx][y] = false;
		}
	}
	else {
		for (int i = 0; i < 2; i++) {//动y轴
			int ty = y + dir[i][1] * step;
			bool flag = false;
			if (ty > y) {
				for (int k = y + 1; k <= ty; k++)
					if (du[x][k]) {
						flag = true;
						break;
					}
			}
			else {
				for (int k = ty; k < y; k++)
					if (du[x][k]) {
						flag = true;
						break;
					}
			}
			if (flag || vis[x][ty])continue;
			ans[step] = i;
			vis[x][ty] = true;
			dfs(x, ty, step + 1, i);
			vis[x][ty] = false;
		}
	}
}
int main(void) {
	//freopen("in.txt", "r", stdin);
	//freopen("out.txt", "w", stdout);
	scanf("%d", &t);
	while (t--) {
		scanf("%d %d", &n, &m);
		memset(du, 0, sizeof(du));
		while (m--) {
			int x, y;
			scanf("%d %d", &x, &y);
			du[x + base][y + base] = true;
		}
		cnt = 0;
		memset(vis, 0, sizeof(vis));
		for (int i = 0; i < 4; i++) {
			int x = base + dir[order[i]][0];
			int y = base + dir[order[i]][1];
			if (du[x][y] || vis[x][y])continue;
			ans[1] = order[i];
			vis[x][y] = true;
			dfs(x, y, 2, order[i]);
			vis[x][y] = false;
		}
		printf("Found %d golygon(s).\n\n", cnt);
	}
	return 0;
}