POJ——T 3020 Antenna Placement

http://poj.org/problem?id=3020

Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 9844   Accepted: 4868

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

题意:*是城市,基站只能安到城市上,可以覆盖上下左右至多2个位置,求最小的基站数、

恶心的建图~

两个点间的覆盖,尝试最小路径覆盖

考虑拆点,将每个城市以及他能覆盖的位置连边,因为两个位置是相互影响的,所以是无向二分图

所以ans=总城市数-最大匹配数/2;

 1 #include <cstring>
 2 #include <cstdio>
 3
 4 using namespace std;
 5
 6 char s[440];
 7 int fx[4]={0,1,0,-1};
 8 int fy[4]={1,0,-1,0};
 9 bool vis[440],map[440][440];
10 int cnt,match[440],if_[440][440];
11
12 int find(int u)
13 {
14     for(int v=1;v<=cnt;v++)
15         if(map[u][v]&&!vis[v])
16         {
17             vis[v]=1;
18             if(!match[v]||find(match[v]))
19             {
20                 match[v]=u;
21                 return true;
22             }
23         }
24     return false;
25 }
26
27 int main()
28 {
29     int t; scanf("%d",&t);
30     for(int n,m,ans=0;t--;cnt=ans=0)
31     {
32         scanf("%d%d",&n,&m);
33         for(int i=1;i<=n;i++)
34         {
35             scanf("%s",s+1);
36             for(int j=1;j<=m;j++)
37               if(s[j]==‘*‘) if_[i][j]=++cnt;
38         }
39         for(int i=1;i<=n;i++)
40           for(int j=1;j<=m;j++)
41             if(if_[i][j])
42              for(int k=0;k<4;k++)
43              {
44                  int x=i+fx[k],y=j+fy[k];
45                  if(if_[x][y])
46                      map[if_[i][j]][if_[x][y]]=1;
47              }
48         for(int i=1;i<=cnt;i++)
49         {
50             if(find(i)) ans++;
51             memset(vis,0,sizeof(vis));
52         }
53         printf("%d\n",cnt-ans/2);
54         memset(map,0,sizeof(map));
55         memset(if_,0,sizeof(if_));
56         memset(match,0,sizeof(match));
57     }
58     return 0;
59 }
时间: 2024-10-12 19:35:30

POJ——T 3020 Antenna Placement的相关文章

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 st

(poj)3020 Antenna Placement 匹配

题目链接 : http://poj.org/problem?id=3020 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

poj 3020 Antenna Placement 解题报告

题目链接:http://poj.org/problem?id=3020 题目意思:首先,请忽略那幅有可能误导他人成分的截图(可能我悟性差,反正有一点点误导我了). 给出一幅 h * w 的图,  “ * ” 表示 point of interest,“ o ” 忽略之.你可以对 " * " (假设这个 “* ”的坐标是 (i, j))画圈,每个圈只能把它四周的某一个点括住(或者是上面(i-1, j) or 下面(i+1, j) or 左边(i, j-1)  or 右边(i, j+1))

POJ 3020 Antenna Placement ,二分图的最小路径覆盖

题目大意: 一个矩形中,有N个城市'*',现在这n个城市都要覆盖无线,若放置一个基站,那么它至多可以覆盖相邻的两个城市. 问至少放置多少个基站才能使得所有的城市都覆盖无线? 无向二分图的最小路径覆盖 = 顶点数 –  最大二分匹配数/2 路径覆盖就是在图中找一些路径,使之覆盖了图中的所有顶点,且任何一个顶点有且只有一条路径与之关联: #include<cstdio> #include<cstring> #include<vector> #include<algor

POJ 3020 Antenna Placement(二分图建图训练 + 最小路径覆盖)

题目链接:http://poj.org/problem?id=3020 Antenna Placement Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 6692   Accepted: 3325 Description The Global Aerial Research Centre has been allotted the task of building the fifth generation of mobi

二分图匹配(匈牙利算法) POJ 3020 Antenna Placement

题目传送门 1 /* 2 题意:*的点占据后能顺带占据四个方向的一个*,问最少要占据多少个 3 匈牙利算法:按坐标奇偶性把*分为两个集合,那么除了匹配的其中一方是顺带占据外,其他都要占据 4 */ 5 #include <cstdio> 6 #include <algorithm> 7 #include <cstring> 8 #include <vector> 9 using namespace std; 10 11 const int MAXN = 4e

poj 3020 Antenna Placement(最小路径覆盖 + 构图)

http://poj.org/problem?id=3020 Antenna Placement Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 7565   Accepted: 3758 Description The Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile ph

POJ 3020 Antenna Placement(二分图匹配)

POJ 3020 Antenna Placement 题目链接 题意:给定一个地图,'*'的地方要被覆盖上,每次可以用1 x 2的矩形去覆盖,问最少用几个能覆盖 思路:二分图匹配求最大独立集,相邻*之间连边,然后求最大独立集即可 看这数据范围,用轮廓线dp应该也能搞 代码: #include <cstdio> #include <cstring> #include <vector> #include <algorithm> using namespace s

POJ 3020 Antenna Placement 最大匹配

Antenna Placement Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 6445   Accepted: 3182 Description The Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most st