HDU 4770 Lights Against Dudely(2013 Asia Hangzhou Regional Contest A)

最新推荐文章于 2017-12-31 20:25:45 发布

bigfiremelon

最新推荐文章于 2017-12-31 20:25:45 发布

阅读量460

点赞数

分类专栏： acm 文章标签： HDU 4770 Lights Agai

本文链接：https://blog.csdn.net/bigwaterlon/article/details/49252715

版权

acm 专栏收录该内容

62 篇文章 0 订阅

订阅专栏

Lights Against Dudely

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2440 Accepted Submission(s): 742

Problem Description

Harry: "But Hagrid. How am I going to pay for all of this? I haven't any money."
Hagrid: "Well there's your money, Harry! Gringotts, the wizard bank! Ain't no safer place. Not one. Except perhaps Hogwarts."
— Rubeus Hagrid to Harry Potter.
Gringotts Wizarding Bank is the only bank of the wizarding world, and is owned and operated by goblins. It was created by a goblin called Gringott. Its main offices are located in the North Side of Diagon Alley in London, England. In addition to storing money and valuables for wizards and witches, one can go there to exchange Muggle money for wizarding money. The currency exchanged by Muggles is later returned to circulation in the Muggle world by goblins. According to Rubeus Hagrid, other than Hogwarts School of Witchcraft and Wizardry, Gringotts is the safest place in the wizarding world.
The text above is quoted from Harry Potter Wiki. But now Gringotts Wizarding Bank is not safe anymore. The stupid Dudley, Harry Potter's cousin, just robbed the bank. Of course, uncle Vernon, the drill seller, is behind the curtain because he has the most advanced drills in the world. Dudley drove an invisible and soundless drilling machine into the bank, and stole all Harry Potter's wizarding money and Muggle money. Dumbledore couldn't stand with it. He ordered to put some magic lights in the bank rooms to detect Dudley's drilling machine. The bank can be considered as a N × M grid consisting of N × M rooms. Each room has a coordinate. The coordinates of the upper-left room is (1,1) , the down-right room is (N,M) and the room below the upper-left room is (2,1)..... A 3×4 bank grid is shown below:

　　Some rooms are indestructible and some rooms are vulnerable. Dudely's machine can only pass the vulnerable rooms. So lights must be put to light up all vulnerable rooms. There are at most fifteen vulnerable rooms in the bank. You can at most put one light in one room. The light of the lights can penetrate the walls. If you put a light in room (x,y), it lights up three rooms: room (x,y), room (x-1,y) and room (x,y+1). Dumbledore has only one special light whose lighting direction can be turned by 0 degree,90 degrees, 180 degrees or 270 degrees. For example, if the special light is put in room (x,y) and its lighting direction is turned by 90 degrees, it will light up room (x,y), room (x,y+1 ) and room (x+1,y). Now please help Dumbledore to figure out at least how many lights he has to use to light up all vulnerable rooms.
　　Please pay attention that you can't light up any indestructible rooms, because the goblins there hate light.

Input

　　There are several test cases.
　　In each test case:
　　The first line are two integers N and M, meaning that the bank is a N × M grid(0<N,M <= 200).
　　Then a N×M matrix follows. Each element is a letter standing for a room. '#' means a indestructible room, and '.' means a vulnerable room.
　　The input ends with N = 0 and M = 0

Output

　　For each test case, print the minimum number of lights which Dumbledore needs to put.
　　If there are no vulnerable rooms, print 0.
　　If Dumbledore has no way to light up all vulnerable rooms, print -1.

Sample Input

  
  
   
   2 2
##
##
2 3
#..
..#
3 3
###
#.#
###
0 0

Sample Output

题目大意：

有一个金库需要在危险的地方照亮，每一盏灯的放置之后会使它的上一间和右边一间变亮，其中只有一盏灯可以调整角度，问至少要多少盏灯。

解题思路：

枚举所有灯的情况取最小值就可以了。

#include <cmath>
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
#define mem(a,b) memset(a,b,sizeof(a))
typedef long long ll;
const int maxn=1e3+10;
const int INF=0x3f3f3f3f;
const ll Mod=1000000007;
int n,m,vis[250][250],num,light;
char map[250][250],pos[20][2];
int go[2][5]={{0,-1,0,1,0},{-1,0,1,0,-1}};
bool judge(int x,int y)
{
    if(x<1||y<1||x>n||y>m)    
		return false;
    return true;
}
int nums1(int x)
{
    int sum=0;
    while(x)
    {
        sum+=x%2;
        x=x/2;
    }
    return sum;
}
bool isok(int flag,int sum)
{
    for(int i=0;i<num;i++)
    {
        int x=pos[i][0],y=pos[i][1];
        if(vis[x][y]!=sum)   vis[x][y]=0;
    }
    for(int i=0;i<num;i++)
    {
        if((flag>>i)&1)
        {
            int x=pos[i][0],y=pos[i][1];
            int x1=x-1,y1=y;
            int x2=x,y2=y+1;
            if(judge(x1,y1)&&map[x1][y1]=='#')
				return false;
			if(!vis[x1][y1])
				vis[x1][y1]=1;
			if(judge(x2,y2)&&map[x2][y2]=='#')
				return false;
			if(!vis[x2][y2])
				vis[x2][y2]=1;
			if(!vis[x][y])
				vis[x][y]=1;
        }
    }
    for(int i=0;i<num;i++)
    {
        int x=pos[i][0],y=pos[i][1];
        if(vis[x][y]==0)   return false;
    }
    return true;
}
int main()
{
    while(scanf("%d %d",&n,&m)&&(n+m))
    {
        num=0;
        memset(vis,0,sizeof(vis));
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                scanf(" %c",&map[i][j]);
                if(map[i][j]=='.')
                {
                    pos[num][0]=i;
                    pos[num][1]=j;
                    num++;
                }
            }
        }
        if(num==0)
        {
            printf("0\n");
            continue;
        }
        int ans=INF,sum=10000,step=1<<num;
        for(int i=0;i<num;i++)
        {
            int x=pos[i][0],y=pos[i][1];
            for(int j=0;j<4;j++)
            {
                for(int k=0;k<num;k++)
                {
                    int xx=pos[k][0],yy=pos[k][1];
                    vis[xx][yy]=0;
                }
                int now1x=x+go[0][j],now1y=y+go[1][j],now2x=x+go[0][j+1],now2y=y+go[1][j+1];
                if((judge(now1x,now1y)&&map[now1x][now1y]=='#')||(judge(now2x,now2y)&&map[now2x][now2y]=='#'))
					continue;
                sum++;
                vis[now1x][now1y]=sum;
                vis[now2x][now2y]=sum;
                vis[x][y]=sum;
                for(int k=0;k<step;k++)
                {
                    if((k>>i)&1)  
						continue;
                    if(isok(k,sum))   
						ans=min(ans,1+nums1(k));
                }
            }
        }
        if(ans==INF)   printf("-1\n");
        else   printf("%d\n",ans);
    }
	return 0;
}