poj 3020 Antenna Placement 二分图匹配
2015-07-27 18:28
288 查看
点击打开链接题目链接
Antenna Placement
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
Sample Output
**代表城市
在城市上可以放基站 一个基站可以提供2个相邻城市的信号
问让所有城市都有信号最少需要的基站数
二分图匹配
代码:
Antenna Placement
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 7386 | Accepted: 3651 |
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
**代表城市
在城市上可以放基站 一个基站可以提供2个相邻城市的信号
问让所有城市都有信号最少需要的基站数
二分图匹配
代码:
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; int maps[444][444]; bool g[444][444]; int link[444]; bool vis[444]; char str[444][444]; int cnt; int h,w; void build(){ for(int i=0;i<h;i++){ for(int j=0;j<w;j++){ if(str[i][j]=='*'){ if(i>0&&str[i-1][j]=='*') g[maps[i][j]][maps[i-1][j]]=g[maps[i-1][j]][maps[i][j]]=1; if(i<h-1&&str[i+1][j]=='*') g[maps[i][j]][maps[i+1][j]]=g[maps[i+1][j]][maps[i][j]]=1; if(j>0&&str[i][j-1]=='*') g[maps[i][j]][maps[i][j-1]]=g[maps[i][j-1]][maps[i][j]]=1; if(j<w-1&&str[i][j+1]=='*') g[maps[i][j]][maps[i][j+1]]=g[maps[i][j+1]][maps[i][j]]=1; } } } } bool finds(int x){ for(int j=0;j<cnt;j++){ if(g[x][j]&&!vis[j]){ vis[j]=1; if(link[j]==-1||finds(link[j])){ link[j]=x; return 1; } } } return 0; } int main(){ int t; scanf("%d",&t); while(t--){ cnt=0; scanf("%d %d",&h,&w); for(int i=0;i<h;i++){ scanf("%s",str[i]); for(int j=0;j<w;j++){ if(str[i][j]=='*') maps[i][j]=cnt++; } } memset(g,0,sizeof(g)); build(); int res=0; memset(link,-1,sizeof(link)); for(int i=0;i<cnt;i++){ memset(vis,0,sizeof(vis)); if(finds(i)) res++; } printf("%d\n",cnt-res/2); } }
相关文章推荐
- leetcode刷题 总结 记录 备忘 64
- 关联源码
- codeforce Gym 100500H ICPC Quest (简单dp)
- android学习笔记---63-PopupWindow,泡泡窗口的实现
- 中国澳门sinox很多平台CAD制图、PCB电路板、IC我知道了、HDL硬件描述语言叙述、电路仿真和设计软件,元素分析表
- 排序算法 java实现
- HDU 3529 Bomberman - Just Search!
- 美团Android自动化之旅—生成渠道包
- 操作系统知识点
- SQLServer中事务日志已满的原因以及解决办法
- Android蓝牙开发浅谈
- IntelliJ IDEA 注册码
- JVM 进阶 六
- HDU 2295 Radar
- android实战中遇到的问题汇总
- 求八皇后问题的92个解并在棋盘上显示它们
- MYCNCART 自适应主题模板 MCCThemes-005
- 主席树初探
- ios申请真机调试(Xcode 5)详细解析
- Ubuntu 下大文件夹分卷压缩