习题7-17(uva-11694)

#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 maxn = 101, maxm = 11, Dirs[4][2] = { {0,0},{0,1},{1,0},{1,1} };
int n,ufs[maxn],ans[maxm][maxm],input[maxm][maxm],cur[maxm][maxm],lim[maxm][maxm];

void Init()
{
	int len = n * n;
	for (int i = 1; i <= len; i++) ufs[i] = i;
	memset(cur, 0, sizeof(cur));
}
int GetFather(int fa) {
	return ufs[fa] == fa ? fa: GetFather(ufs[fa]);
}

inline bool ok(int x, int y) {
	if (input[x][y] == -1) return true;
	if (cur[x][y] <= input[x][y] && cur[x][y] + lim[x][y] >= input[x][y]) return true;
	return false;
}

bool dfs(int x, int y) {
	if (y == n) y = 1, x++;
	if (x == n) return true;

	// 以下是加左上到右下方向的斜（‘\’）
	++cur[x][y], ++cur[x + 1][y + 1];
	--lim[x][y], --lim[x + 1][y], --lim[x][y + 1], --lim[x + 1][y + 1];

	bool isok = true;
	for (int i = 0; i < 4; i++) {
		int xx = x + Dirs[i][0], yy = y + Dirs[i][1];
		if (!ok(xx, yy)) { isok = false; break; }
	}

	if (isok) {
		int fa = GetFather((x - 1) * n + y), fb = GetFather(x * n + y + 1);
		if (fa != fb) {
			ans[x][y] = 1;
			ufs[fa] = fb;
			if (dfs(x, y + 1)) return true;
			ufs[fa] = fa;
		}
	}
	--cur[x][y], --cur[x + 1][y + 1];
	// 以下是加右上到左下方向的斜（‘/’）
	++cur[x + 1][y], ++cur[x][y + 1];
	isok = true;
	for (int i = 0; i < 4; i++) {
		int xx = x + Dirs[i][0], yy = y + Dirs[i][1];
		if (!ok(xx, yy)) { isok = false; break; }
	}
	if (isok) {
		int fa = GetFather(x * n + y), fb = GetFather((x - 1) * n + y + 1);
		if (fa != fb) {
			ans[x][y] = 0;
			ufs[fa] = fb;
			if (dfs(x, y + 1)) return true;
			ufs[fa] = fa;
		}
	}
	--cur[x + 1][y], --cur[x][y + 1];
	++lim[x][y], ++lim[x + 1][y], ++lim[x][y + 1], ++lim[x + 1][y + 1];
	return false;
}

int main()
{
	int kCase = 0,t;
	char temp[maxn];
	cin >> t;
	while (t--) {
		cin >> n; ++n;
		Init();
		for (int i = 1; i <= n; i++) {
			cin >> temp + 1;
			for (int j = 1; j <= n; j++) {
				//要求条数
				if (temp[j] == '.') input[i][j] = -1;
				else input[i][j] = temp[j] - '0';
				
				//能填充的最大数量
				lim[i][j] = 4;
				
				if ((i == 1 || i == n) && (j == 1 || j == n))
				//顶角
					lim[i][j] = 1;
				else if (i == 1|| i == n || j == 1|| j == n)
				//边界
					lim[i][j] = 2;
			}
		}
		dfs(1, 1);
		for (int i = 1; i < n; i++) {
			for (int j = 1; j < n; j++) {
				if (ans[i][j] == 1) cout << "\\";
				else cout<<"/";
			}
			cout << endl;
		}
	}
	return 0;
}