zoukankan      html  css  js  c++  java
  • POJ 题目3020 Antenna Placement(二分图)

    Antenna Placement
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 7011   Accepted: 3478

    Description

    The Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most striking reason why they got the job, is their discovery of a new, highly noise resistant, antenna. It is called 4DAir, and comes in four types. Each type can only transmit and receive signals in a direction aligned with a (slightly skewed) latitudinal and longitudinal grid, because of the interacting electromagnetic field of the earth. The four types correspond to antennas operating in the directions north, west, south, and east, respectively. Below is an example picture of places of interest, depicted by twelve small rings, and nine 4DAir antennas depicted by ellipses covering them. 
     
    Obviously, it is desirable to use as few antennas as possible, but still provide coverage for each place of interest. We model the problem as follows: Let A be a rectangular matrix describing the surface of Sweden, where an entry of A either is a point of interest, which must be covered by at least one antenna, or empty space. Antennas can only be positioned at an entry in A. When an antenna is placed at row r and column c, this entry is considered covered, but also one of the neighbouring entries (c+1,r),(c,r+1),(c-1,r), or (c,r-1), is covered depending on the type chosen for this particular antenna. What is the least number of antennas for which there exists a placement in A such that all points of interest are covered?

     

    Input

    On the first row of input is a single positive integer n, specifying the number of scenarios that follow. Each scenario begins with a row containing two positive integers h and w, with 1 <= h <= 40 and 0 < w <= 10. Thereafter is a matrix presented, describing the points of interest in Sweden in the form of h lines, each containing w characters from the set ['*','o']. A '*'-character symbolises a point of interest, whereas a 'o'-character represents open space. 

    Output

    For each scenario, output the minimum number of antennas necessary to cover all '*'-entries in the scenario's matrix, on a row of its own.

    Sample Input

    2
    7 9
    ooo**oooo
    **oo*ooo*
    o*oo**o**
    ooooooooo
    *******oo
    o*o*oo*oo
    *******oo
    10 1
    *
    *
    *
    o
    *
    *
    *
    *
    *
    *
    

    Sample Output

    17
    5

    Source

    Svenskt Mästerskap i Programmering/Norgesmesterskapet 2001

    ac代码

    #include<stdio.h>
    #include<string.h>
    int map[1010][1010],cut[1010][1010];
    int link[101000],vis[101000],x,y,cnt;
    char str[1010][1010];
    int dfs(int u)
    {
    	int i;
    	for(i=1;i<=cnt;i++)
    	{
    		if(!vis[i]&&map[u][i])
    		{
    			vis[i]=1;
    			if(link[i]==-1||dfs(link[i]))
    			{
    				link[i]=u;
    				return 1;
    			}
    		}
    	}
    	return 0;
    }
    int main()
    {
    	int t;
    	scanf("%d",&t);
    	while(t--)
    	{
    		int n,m,i,j;
    		scanf("%d%d",&n,&m);
    		for(i=0;i<n;i++)
    		{
    			scanf("%s",str[i]);
    		}
    		//	int x=0
    		cnt=0;
    		memset(cut,0,sizeof(cut));
    		for(i=0;i<n;i++)
    		{
    			for(j=0;j<m;j++)
    			{
    				if(str[i][j]=='*')
    					cut[i][j]=++cnt;
    			}
    		}
    		memset(map,0,sizeof(map));
    		for(i=0;i<n;i++)
    		{
    			for(j=0;j<m;j++)
    			{
    				if(cut[i][j])
    				{
    					if(j>0&&cut[i][j-1])
    						map[cut[i][j]][cut[i][j-1]]=1;
    					if(i>0&&cut[i-1][j])
    						map[cut[i][j]][cut[i-1][j]]=1;
    					if(j<m-1&&cut[i][j+1])
    						map[cut[i][j]][cut[i][j+1]]=1;
    					if(i<n-1&&cut[i+1][j])
    						map[cut[i][j]][cut[i+1][j]]=1;
    				}
    			}
    		}
    		memset(link,-1,sizeof(link));
    		int ans=0;
    		for(i=1;i<=cnt;i++)
    		{
    			memset(vis,0,sizeof(vis));
    			if(dfs(i))
    				ans++;
    		}
    		printf("%d
    ",cnt-ans/2);
    	}
    }


  • 相关阅读:
    Spark 之 内存模型
    Python 之 windows上安装和pycharm 使用
    Kafka之 kafka消费->SparkStreaming|写入->Kafka|kafka消费->hbase
    SparkStreaming之 任务失败后,自动重启
    微信小程序常用赋值方法小结
    eclipse中xml文件Ctrl+左键不跳转解决办法
    SpringCloud简介以及相关组件
    spring怎么设置定时任务
    Http协议请求的不同类型
    Spring各个jar包作用
  • 原文地址:https://www.cnblogs.com/gavanwanggw/p/6891110.html
Copyright © 2011-2022 走看看