poj 2870

 

Light Up

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 459		Accepted: 181

Description

Light Up is a puzzle set in a rectangular board divided in smaller squares. Some squares in the board are ``empty'' (white squares the figure below), some squares are ``barriers'' (dark squares in the figure below). A barrier square may have an integer number i associated to it (0 <= i <= 4). 

 
Figure 2: (a) Puzzle with 6 rows, 7 columns and 7 barriers; (b) a solution to the puzzle.

In this puzzle the goal is to ``light up'' all the empty squares by placing lamps in some of them (lamps are depicted as circles in the figure). Each lamp illuminates the square it is on, plus all squares in line with it, horizontally or vertically, up to a barrier square or the board end. 

A winning configuration satisfies the following conditions:

• all empty squares must be lit;
• no lamp may be lit by another lamp;
• all numbered barrier squares must have exactly that number of lamps adjacent to them (in the four squares above, below, and to the side);
• non-numbered barrier squares may have any number of lamps adjacent to them.

You must write a program to determine the smallest number of lamps that are needed to reach a winning configuration.

Input

The input contains several test cases. The first line of a test case contains two integers N, M indicating respectively the number of rows and the number of columns of the board (1 <= N <= 7, 1 <= M <= 7). The second line contains one integer B indicating the number of barrier squares (0 <= B <= N × M). Each of the next B lines describe a barrier, containing three integers R, C and K, representing respectively the row number (1 <= R <= N), the column number (1 <= C <= M) and the barrier number (-1 <= K <= 4); K = -1 means the barrier is unnumbered. The end of input is indicated by N = M = 0.

Output

For each test case in the input your program must produce one line of output, containing either an integer indicating the smallest number of lamps needed to reach a winning configuration, in case such a configuration exists, or the words `No solution'.

Sample Input

2 2
0
2 2
1
2 2 1
6 7
7
2 3 -1
3 3 0
4 2 1
5 4 3
5 6 2
1 7 -1
6 5 -1
0 0

Sample Output

2
No solution
8

Source

South America 2005

分析：深搜+剪枝，为什么大家都说水题，我怎么不觉得，而且不能秒杀，难道我水了。。。

 #include <iostream> using namespace std; bool light[10][10],mm[10][10]={0}; int dark[10][10],num[10][10],map[10][10],n,m,b,ans; bool ok(int x,int y) { if((map[x-1][y]>-1)&&(num[x-1][y]!=map[x-1][y]))return 0; if((map[x][y-1]>-1)&&(num[x][y-1]>map[x][y-1]))return 0; if((map[x+1][y]>-1)&&(num[x+1][y]>map[x+1][y]))return 0; if((map[x][y+1]>-1)&&(num[x][y+1]>map[x][y+1]))return 0; return 1; } void dfs(int x,int y,bool flag,int now) { if(now>ans)return; if(y>m) { if(x==n) { for(int i=1;i<=m;++i) if((dark[x][i]>0)||((map[x][i]>-1)&&(num[x][i]!=map[x][i])))return; ans=now; return; } for(int i=1;i<=m;++i)light[x+1][i]=light[x][i]; dfs(x+1,1,0,now);return; } if(map[x][y]<-1) { if((!light[x][y])&&(!flag)) { for(int i=y-1;i>0;--i) if(map[x][i]<-1)--dark[x][i]; else break; light[x][y]=1;dark[x][y]=0;mm[x][y]=1; ++num[x-1][y];++num[x+1][y];++num[x][y-1];++num[x][y+1]; if(ok(x,y))dfs(x,y+1,1,now+1); for(int i=y-1;i>0;--i) if(map[x][i]<-1)++dark[x][i]; else break; light[x][y]=0;mm[x][y]=0; --num[x-1][y];--num[x+1][y];--num[x][y-1];--num[x][y+1]; } if(ok(x,y)) { if(light[x][y])dark[x][y]=0; else if(flag)dark[x][y]=dark[x-1][y]; else dark[x][y]=dark[x-1][y]+1; dfs(x,y+1,flag,now); } } else if(dark[x-1][y]>0)return; else if(ok(x,y))light[x][y]=0,dfs(x,y+1,0,now); } int main(int argc, char** argv) { //freopen("car.in","r",stdin); //freopen("car.out","w",stdout); while(scanf("%d%d",&n,&m),n!=0) { memset(dark,0,sizeof(dark)); memset(light,0,sizeof(light)); memset(num,0,sizeof(num)); for(int i=0;i<=n+1;++i) for(int j=0;j<=m+1;++j)map[i][j]=-2; scanf("%d",&b); while(b--) { int r,c; scanf("%d%d",&r,&c); scanf("%d",&map[r][c]); } ans=INT_MAX; dfs(1,1,0,0); if(ans<INT_MAX)printf("%d/n",ans); else printf("No solution/n"); } return 0; }