POJ 3020 Antenna Placement
来源:互联网 发布:吉他入门软件下载 编辑:程序博客网 时间:2024/05/17 09:12
Antenna Placement
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8613 Accepted: 4266
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?
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
27 9ooo**oooo**oo*ooo*o*oo**o**ooooooooo*******ooo*o*oo*oo*******oo10 1***o******
Sample Output
175
#include<iostream>#include<cstdio>#include<cstring>using namespace std;char mp[512][512];int a[512][512];int fn[512][512];int xx[]={1,-1,0,0};int yy[]={0,0,1,-1};int flag[66666];bool vis[66666];int ans;int dfs(int ss){ for(int i=1;i<ans;i++){ if(fn[ss][i]&&!vis[i]){ vis[i]=true; if(flag[i]==0||dfs(flag[i])){ flag[i]=ss; return 1; } } } return 0;}int get(){ int sum=0; for(int i=1;i<ans;i++){ memset(vis,false,sizeof(vis)); sum+=dfs(i); } return sum;}int main(){ int t; cin>>t; while(t--) { int n,m; cin>>n>>m; getchar(); for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++) scanf("%c",&mp[i][j]); char ss[3]; gets(ss); } ans=1; memset(a,0,sizeof(a)); memset(fn,0,sizeof(fn)); memset(flag,0,sizeof(flag)); for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) if(mp[i][j]=='*') a[i][j]=ans++; // cout<<ans<<endl; for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) { if(a[i][j]){ for(int h=0;h<4;h++){ int nx=i+xx[h]; int ny=j+yy[h]; if(a[nx][ny]) fn[a[i][j]][a[nx][ny]]=1; } } } cout<<ans-1-(get()/2)<<endl; } return 0;}
0 0
- poj 3020 Antenna Placement
- Poj 3020 Antenna Placement
- Poj 3020 Antenna Placement
- poj 3020 Antenna Placement
- POJ 3020 Antenna Placement
- POJ 3020 Antenna Placement
- POJ 3020 Antenna Placement
- POJ 3020 Antenna Placement
- POJ 3020 Antenna Placement
- POJ 3020 Antenna Placement
- poj 3020 Antenna Placement
- POJ 3020 Antenna Placement
- POJ 3020 Antenna Placement
- POJ 3020Antenna Placement
- 【POJ 3020】Antenna Placement
- poj 3020 Antenna Placement
- poj-3020 Antenna Placement
- POJ 3020 Antenna Placement
- Java基础学习——泛型(generics)二
- java学习路线目录
- 安装Python2.7其他必要库
- chrome学习连接
- Java线程间数据传递
- POJ 3020 Antenna Placement
- 人体的构造
- 设置Eclipse单行文本长度
- Linux设置静态ip后遇到的问题及其解决方案
- Maven简介和安装配置
- Echarts图表的简单实现
- Effective C++读书笔记---确定对象被使用前已先被初始化
- 别人的大学 ACM进阶指南
- HDU 5781 ATM Mechine 多校赛 概率dp