hdu 5113 Black And White (dfs+强力剪枝)

题意：

给出每种颜色的个数，现在要在n*m的各自上染色，问能否染成相邻颜色都不同的状态。

题解：

dfs肯定能想到，但是剪枝比较难想到，当染色到某个状态时，如果某个颜色的个数大于剩下各自的一半就剪枝，可以这样想：因为同种颜色不能相邻，那么极端情况，将这种颜色格一个格子放置，那么如果这种情况还有剩肯定无法满足条件。还有一个自己YY的优化方法，就是尽量让个数多的颜色先放置，那么就将颜色按个数排序，不过经测试快不了多少。

#include<iostream>
#include<math.h>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#define B(x) (1<<(x))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned ui;
const int oo = 0x3f3f3f3f;
//const ll OO = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-9;
#define lson rt<<1
#define rson rt<<1|1
void cmax(int& a, int b){ if (b > a)a = b; }
void cmin(int& a, int b){ if (b < a)a = b; }
void cmax(ll& a, ll b){ if (b > a)a = b; }
void cmin(ll& a, ll b){ if (b < a)a = b; }
void cmax(double& a, double b){ if (a - b < eps) a = b; }
void cmin(double& a, double b){ if (b - a < eps) a = b; }
void add(int& a, int b, int mod){ a = (a + b) % mod; }
void add(ll& a, ll b, ll mod){ a = (a + b) % mod; }
const ll MOD = 1000000007;
const int maxn = 2100;
int g[6][6], num[30], ans[6][6], pos[30];
int n, m, k, f;

bool cmp(int x, int y){
	return x > y;
}

void Copy(){
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m; j++)
			ans[i][j] = g[i][j];
	}
}

void dfs(int x, int y, int cnt){
	if (f) return;
	for (int i = 1; i <= k; i++){
		if (num[pos[i]] > (cnt + 1) / 2) return;
	}
	if (x == n){
		f = 1;
		Copy();
		return;
	}
	for (int i = 1; i <= k; i++){
		if (num[pos[i]] == 0)continue;
		if (x > 0 && g[x - 1][y] == pos[i])continue;
		if (y > 0 && g[x][y - 1] == pos[i])continue;
		num[pos[i]]--;
		g[x][y] = pos[i];
		if (y + 1 < m) dfs(x, y + 1, cnt - 1);
		else dfs(x + 1, 0, cnt - 1);
		num[pos[i]]++;
	}
}

int main(){
	//freopen("E:\\read.txt", "r", stdin);
	int T, cas = 1;
	scanf("%d", &T);
	while (T--){
		scanf("%d %d %d", &n, &m, &k);
		for (int i = 1; i <= k; i++){
			scanf("%d", &num[i]);
			pos[i] = i;
		}
		printf("Case #%d:\n", cas++);
		sort(pos + 1, pos + 1 + k, cmp);
		f = 0;
		dfs(0, 0, n * m);
		if (f){
			puts("YES");
			for (int i = 0; i < n; i++){
				for (int j = 0; j < m - 1; j++)
					printf("%d ", ans[i][j]);
				printf("%d\n", ans[i][m - 1]);
			}
		}
		else puts("NO");
	}
	return 0;
}
/*
1
5 5 5
1 5 5 5 9
*/