The Domino Effect UVA - 211

本题实现起来难度不大，主要难在思维上。首先是对每个骰子的信息进行记录，number[a][b]=amount中，amount是骰子的编号，a和b分别代表着骰子的两个面的值，那么在放置的时候对于每个骰子，不是竖着向下放置就是横着向右进行放置，这也就给我们了一个思路，可以使用dfs进行深度搜索，分别向下或者向右进行搜索，在搜索的过程当中要注意好行列之间的关系，同时要记录已经有哪些骰子使用过，就行了，具体实现见如下代码：

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
#include<functional>
using namespace std;

int Case,total;
int number[7][7];
int data[7][8],res[7][8];
bool useData[30],visit[7][8];
int dir[2][2] = {
	{1,0},
	{0,1}
};

void Init(){
	int amount = 1;
	for (int i = 0; i < 7; i++){
		for (int j = i; j < 7; j++){
			number[i][j] = number[j][i] = amount++;
		}
	}
}

bool judge(int row){
	for (int j = 0; j < 8; j++){
		if (!visit[row][j]) return false;
	}
	return true;
}

void dfs(int row, int col, int num){
	if (num == 28){
		for (int i = 0; i < 7; i++){
			for (int j = 0; j < 8; j++){
				printf("%4d",res[i][j]);
			}
			printf("\n");
		}
		printf("\n");
		total++;
		return;
	}
	if (row == 7) return;
	if (col == 8){
		if (!judge(row)) return;
		dfs(row + 1, 0, num);
		return;
	}
	if (visit[row][col]){
		dfs(row, col + 1, num);
		return;
	}
	for (int i = 0; i < 2; i++){//试探性地向下以及向右
		if (i == 0 && row == 6) continue;
		if (i == 1 && col == 7) continue;
		int newr = row + dir[i][0], newc = col + dir[i][1];
		if (visit[newr][newc]) continue;
		if (useData[number[data[row][col]][data[newr][newc]]]) continue;
		res[row][col] = res[newr][newc] = number[data[row][col]][data[newr][newc]];
		useData[number[data[row][col]][data[newr][newc]]] = visit[row][col] = visit[newr][newc] = 1;
		dfs(row, col+1, num + 1);
		useData[number[data[row][col]][data[newr][newc]]] = visit[row][col] = visit[newr][newc] = 0;
	}
}

void solve(){
	if (Case) printf("\n\n\n");
	Case++;
	memset(useData, 0, sizeof(useData));
	memset(visit, 0, sizeof(visit));
	printf("Layout #%d:\n\n",Case);
	for (int i = 0; i < 7; i++){
		for (int j = 0; j < 8; j++){
			printf("%4d",data[i][j]);
		}
		printf("\n");
	}
	printf("\nMaps resulting from layout #%d are:\n\n",Case);
	dfs(0, 0, 0);
	printf("There are %d solution(s) for layout #%d.\n",total,Case);
}

int main(){
	Case = 0;
	Init();
	while (cin >> data[0][0]){
		total = 0;
		for (int i = 0; i < 7; i++){
			for (int j = 0; j < 8; j++){
				if (i == 0 && j == 0) continue;
				cin >> data[i][j];
			}
		}
		solve();
	}
	return 0;
}