Black And White
Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 5284 Accepted Submission(s): 1452
Special Judge
Problem Description
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.
— 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 .
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.
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
Source
题意:给了一个N*M的棋盘,和k种颜色,每种颜色有ci个,加在一起的和为N*M。在棋盘上染色,相邻的两个地方不能是同一种颜色,如果可以这样染色,那么输出YES并且输出这种情况。否则输出NO。
思路:用dfs来搜索,从左到右从上到下的搜索。对每一个格子枚举每一种颜色。这样的话会超时,这时候要剪枝了。
考虑到在一个棋盘中最多只能有(num+1)/2个同种的颜色,所以如果在搜索的时候碰到了c[i]>(num+1)/2的情况,这样的情况是不对的,直接返回就行了。
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int n,m,k,flag;
int c[3000];
int mapp[55][55];
void dfs(int x,int y,int num)
{
if(num==0) {flag=1;return;}
for(int i=1;i<=k;i++)
{
if(c[i]>(num+1)/2)
return;
}
for(int i=1;i<=k;i++)
{
if(c[i]!=0&&mapp[x][y-1]!=i&&mapp[x-1][y]!=i)
{
mapp[x][y]=i;
c[i]--;
if(y+1>m)
{
dfs(x+1,1,num-1);
}
else
{
dfs(x,y+1,num-1);
}
if(flag==1) return;
mapp[x][y]=0;
c[i]++;
}
}
}
int main()
{
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",&c[i]);
flag=0;
dfs(1,1,n*m);
printf("Case #%d:\n",cas++);
if(!flag)
printf("NO\n");
else
{
printf("YES\n");
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(j==m)
printf("%d\n",mapp[i][j]);
else
printf("%d ",mapp[i][j]);
}
}
}
}
return 0;
}