poj 3026 Borg Maze(最小生成树)
来源:互联网 发布:张麟征 知乎 编辑:程序博客网 时间:2024/05/17 18:47
题目链接
Borg Maze
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13003 Accepted: 4250
Description
The Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to describe the group consciousness of the Borg civilization. Each Borg individual is linked to the collective by a sophisticated subspace network that insures each member is given constant supervision and guidance.
Your task is to help the Borg (yes, really) by developing a program which helps the Borg to estimate the minimal cost of scanning a maze for the assimilation of aliens hiding in the maze, by moving in north, west, east, and south steps. The tricky thing is that the beginning of the search is conducted by a large group of over 100 individuals. Whenever an alien is assimilated, or at the beginning of the search, the group may split in two or more groups (but their consciousness is still collective.). The cost of searching a maze is definied as the total distance covered by all the groups involved in the search together. That is, if the original group walks five steps, then splits into two groups each walking three steps, the total distance is 11=5+3+3.
Your task is to help the Borg (yes, really) by developing a program which helps the Borg to estimate the minimal cost of scanning a maze for the assimilation of aliens hiding in the maze, by moving in north, west, east, and south steps. The tricky thing is that the beginning of the search is conducted by a large group of over 100 individuals. Whenever an alien is assimilated, or at the beginning of the search, the group may split in two or more groups (but their consciousness is still collective.). The cost of searching a maze is definied as the total distance covered by all the groups involved in the search together. That is, if the original group walks five steps, then splits into two groups each walking three steps, the total distance is 11=5+3+3.
Input
On the first line of input there is one integer, N <= 50, giving the number of test cases in the input. Each test case starts with a line containg two integers x, y such that 1 <= x,y <= 50. After this, y lines follow, each which x characters. For each character, a space `` '' stands for an open space, a hash mark ``#'' stands for an obstructing wall, the capital letter ``A'' stand for an alien, and the capital letter ``S'' stands for the start of the search. The perimeter of the maze is always closed, i.e., there is no way to get out from the coordinate of the ``S''. At most 100 aliens are present in the maze, and everyone is reachable.
Output
For every test case, output one line containing the minimal cost of a succesful search of the maze leaving no aliens alive.
Sample Input
26 5##### #A#A### # A##S ####### 7 7##### #AAA#### A## S #### ##AAA########
Sample Output
811
题解:这一题建图很关键,S和A其实等价(后面统称为结点),任意两个结点的距离可以BFS先处理出来,然后其实就是求最小生成树了。不过这题的数据出的比较。。。我写了一份代码但没AC,看了discuss就没什么兴趣改了。
0 0
- poj 3026 Borg Maze 最小生成树
- poj-3026-Borg Maze-最小生成树
- POJ 3026 Borg Maze 最小生成树
- poj 3026 Borg Maze(最小生成树)
- POJ 3026 Borg Maze & UVA 10307 Killing Aliens in Borg Maze(BFS,最小生成树)
- poj 3026 Borg Maze 最小生成树+bfs
- POJ 3026 Borg Maze bfs + 最小生成树
- 初级->图算法->最小生成树 poj 3026 Borg Maze
- poj 3026 Borg Maze bfs建图+最小生成树
- poj 3026 Borg Maze (bfs+最小生成树)
- poj 3026 Borg Maze(搜索+最小生成树)
- POJ 3026 Borg Maze【BFS+最小生成树】
- poj 3026 Borg Maze 最小生成树 + 广搜
- POJ 3026 Borg Maze (最小生成树 + BFS)
- POJ 3026 Borg Maze(BFS+最小生成树)
- poj 3026 Borg Maze (bfs + 最小生成树)
- POJ-3026 Borg Maze(最小生成树)
- POJ 3026 Borg Maze (bfs+最小生成树)
- 0.5px边框学习
- 用IRC协议与PHP木马“聊天” 20160809
- 异或操作实现两数值交换和其中的bug
- Android之人品计算器教程
- 计算数字数组中元素的最值 & KVC用法延伸
- poj 3026 Borg Maze(最小生成树)
- Spring review--动态代理和AOP代码的演化
- Linux日志文件总结
- Spring全局加解密
- JAVA设计模式-模板模式
- 计时器
- Intel x86 Atom System Image
- jQuery实践2:隔行改变表格颜色
- C# 根据字符串对一个枚举类型