Black And White （染色问题，剪枝）

In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions of the map so that no two adjacent regions have the same color. 
— Wikipedia, the free encyclopedia 

In this problem, you have to solve the 4-color problem. Hey, I’m just joking. 

You are asked to solve a similar problem: 

Color an N × M chessboard with K colors numbered from 1 to K such that no two adjacent cells have the same color (two cells are adjacent if they share an edge). The i-th color should be used in exactly c i cells. 

Matt hopes you can tell him a possible coloring.

Input

The first line contains only one integer T (1 ≤ T ≤ 5000), which indicates the number of test cases. 

For each test case, the first line contains three integers: N, M, K (0 < N, M ≤ 5, 0 < K ≤ N × M ). 

The second line contains K integers c i (c i > 0), denoting the number of cells where the i-th color should be used. 

It’s guaranteed that c 1 + c 2 + · · · + c K = N × M . 

Output

For each test case, the first line contains “Case #x:”, where x is the case number (starting from 1). 

In the second line, output “NO” if there is no coloring satisfying the requirements. Otherwise, output “YES” in one line. Each of the following N lines contains M numbers seperated by single whitespace, denoting the color of the cells. 

If there are multiple solutions, output any of them.

Sample Input

4
1 5 2
4 1
3 3 4
1 2 2 4
2 3 3
2 2 2
3 2 3
2 2 2

Sample Output

Case #1:
NO
Case #2:
YES
4 3 4
2 1 2
4 3 4
Case #3:
YES
1 2 3
2 3 1
Case #4:
YES
1 2
2 3
3 1

题意：T组数据，每组数据一个矩阵大小n,m，还有一个颜色种类数K，紧跟着有K种颜色的数量，问能否染色成功，输出一种即可。

思路：一个dfs不过要进行剪枝，就是每次要判断是否所有颜色都有可以完整染色的可能；

eg：不完整的染色，已知A还剩5个，那么最少我们还需要3个其他颜色才能让A不相邻。即  col[i]>(n*m-step+1)/2

代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,k,flag,col[100];
int Map[10][10];
int dir[4][2]= {0,1,1,0,0,-1,-1,0};
bool check(int c,int x,int y)
{
    for(int i=0; i<4; i++)
    {
        int tx=x+dir[i][0];
        int ty=y+dir[i][1];
        if(c==Map[tx][ty])
            return false;
    }
    return true;
}
void dfs(int x,int y,int step)
{
    if(flag)return;
    if(step==n*m)
    {
        flag=1;
        printf("YES\n");
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<m; j++)
                printf("%d ",Map[i][j]);
            printf("%d\n",Map[i][m]);
        }
        return;
    }
    for(int i=1; i<=k; i++) //如果到达这个状态的时候，有些颜色剩余过多就不能完成完整的染色
    {
        //如果还剩颜色a（5个），那么最少还需其他颜色（3个）才能保证a不会相邻
        if(col[i]>(n*m-step+1)/2)
            return;
    }
    for(int i=1; i<=k; i++)
    {
        if(col[i]>0&&check(i,x,y))
        {
            int tx=x;
            int ty=y+1;
            if(ty>m){tx++,ty=1;}
            Map[x][y]=i;
            col[i]--;
            dfs(tx,ty,step+1);
            Map[x][y]=-1;
            col[i]++;
        }
    }
}
int main()
{
    int t,cas=1;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&n,&m,&k);
        memset(Map,-1,sizeof(Map));
        for(int i=1; i<=k; i++)
            scanf("%d",&col[i]);
        flag=0;
        printf("Case #%d:\n",cas++);
        dfs(1,1,0);
        if(!flag)printf("NO\n");
    }
    return 0;
}