题意:先给出了整个拼图的长和宽,然后给出了每一块拼图的形态,有平的 'F' ,凹的 ‘I '凸的 ’O' ,平的拼图只是外围,凹凸在内部,问是否能将拼图拼成。
题解:回溯+剪枝,剪枝1:在递归之气判断如果凹凸不等或F数量不等周长就直接判断NO 。剪枝2:排序,在判断是否放置当前拼图的时候如果不可以放置,和他一样的不用再判断一次。剪枝3:在递归完成后如果已经成功就直接return。
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int N = 50;
char pi[N][5], pos[N][N][5];
int row, col, flag, n, vis[N], fl, cav, jut;
void init() {
memset(vis, 0, sizeof(vis));
memset(pos, 0, sizeof(pos));
for (int i = 1; i <= col; i++)
pos[0][i][2] = 'F';//将外围铺一层是'F'的,不用考虑越界
for (int i = 1; i <= row; i++)
pos[i][0][1] = 'F';//同上
flag = fl = cav = jut = 0;
}
int cmp(const void *a, const void *b) {
return strcmp((char *)a, (char *)b);
}
int judge(int cur, int x, int y) {
if (pi[cur][0] == 'F' && x != 1 || pi[cur][1] == 'F' && y != col || pi[cur][2] == 'F' && x != row || pi[cur][3] == 'F' && y != 1)
return 0;
if ((pi[cur][0] == 'I' && pos[x - 1][y][2] != 'O') || (pi[cur][3] == 'I' && pos[x][y - 1][1] != 'O'))
return 0;
if ((pi[cur][0] == 'O' && pos[x - 1][y][2] != 'I') || (pi[cur][3] == 'O' && pos[x][y - 1][1] != 'I'))
return 0;
return 1;
}
void dfs(int x, int y) {
if (y > col) {
y = 1;
x++;
if (x > row) {
flag = 1;
return;
}
}
char temp[5] = "hehe";
for (int i = 0; i < n; i++) {
if (!vis[i] && judge(i, x, y) && strcmp(temp, pi[i])) {//ÏàͬÌø¹ý
strcpy(temp, pi[i]);
for (int j = 0; j < 4; j++)
pos[x][y][j] = pi[i][j];
vis[i] = 1;
dfs(x, y + 1);
if (flag)//剪枝
return;
vis[i] = 0;
}
}
}
int main() {
while (scanf("%d%d", &row, &col) && (row + col)) {
init();
getchar();
n = row * col;
for (int i = 0; i < n; i++) {
gets(pi[i]);
for (int j = 0; j < 4; j++) {
if (pi[i][j] == 'F')
fl++;
if (pi[i][j] == 'O')
jut++;
if (pi[i][j] == 'I')
cav++;
}
}
qsort(pi, n, sizeof(pi[0]), cmp);//排序后在递归过程中,直接跳到和当前不相同的拼图开始,节省时间
if (cav == jut && fl == 2 * (row + col))//剪枝,凹凸相等,平的等于周长
dfs(1, 1);
if (flag)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}