poj 3026
来源:互联网 发布:阿里云上海机房怎么样 编辑:程序博客网 时间:2024/05/21 10:13
Borg Maze
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8383 Accepted: 2813
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
Source
Svenskt Mästerskap i Programmering/Norgesmesterskapet 2001
题目意思就是求从S点到所有A点的路径值。
AC代码:
#include<iostream>#include<cstring>#include<queue>#include<algorithm>#include<stdio.h>using namespace std;int s,n,m;char map[60][60];int b[60][60];int f[60][60];int G[110][110];struct Node{ int x,y; int step;}a[120];queue <Node> qu;void bfs(Node t){ int x,y; memset(f,0,sizeof(f)); while(!qu.empty()) qu.pop(); f[t.x][t.y]=1; x=map[t.x][t.y]-'0'; qu.push(t); while(!qu.empty()){ Node tmp=qu.front(); qu.pop(); if(map[tmp.x][tmp.y]=='A' || map[tmp.x][tmp.y]=='S'){ G[b[t.x][t.y]][b[tmp.x][tmp.y]]=tmp.step; } if(tmp.x+1<=n && !f[tmp.x+1][tmp.y] && map[tmp.x+1][tmp.y]!='#'){ //下 Node tt=tmp; tt.x++; tt.step++; qu.push(tt); f[tt.x][tt.y]=1; } if(tmp.x-1>=1 && !f[tmp.x-1][tmp.y] && map[tmp.x-1][tmp.y]!='#'){ //上 Node tt=tmp; tt.x--; tt.step++; qu.push(tt); f[tt.x][tt.y]=1; } if(tmp.y+1<=m && !f[tmp.x][tmp.y+1] && map[tmp.x][tmp.y+1]!='#'){ //右 Node tt=tmp; tt.y++; tt.step++; qu.push(tt); f[tt.x][tt.y]=1; } if(tmp.y-1>=1 && !f[tmp.x][tmp.y-1] && map[tmp.x][tmp.y-1]!='#'){ //左 Node tt=tmp; tt.y--; tt.step++; qu.push(tt); f[tt.x][tt.y]=1; } }}int prim(int t){ int sum=0; int vis[110],dis[110]; memset(vis,0,sizeof(vis)); for(int i=1;i<=s;i++) dis[i]=999999; dis[t]=0; for(int i=1;i<=s;i++){ int min=999999; int v; for(int i=1;i<=s;i++){ if(!vis[i] && dis[i]<min){ min=dis[i]; v=i; } } sum+=min; vis[v]=1; for(int j=1;j<=s;j++){ if(!vis[j] && dis[j] > G[v][j]) dis[j]=G[v][j]; } } return sum;}int main(){ int T; cin>>T; while(T--){ cin>>m>>n; gets(map[0]); //吸收n后面的多余空格和\n s=0; memset(b,0,sizeof(b)); for(int i=1;i<=n;i++){ gets(map[i]+1); //cout<<map[i]+1<<endl; for(int j=1;j<=m;j++){ if(map[i][j]=='S' || map[i][j]=='A'){ Node tmp; tmp.x=i; tmp.y=j; tmp.step=0; a[++s]=tmp; b[i][j]=s; //标记 i j 是第s个点 } } } for(int i=1;i<=s;i++){ bfs(a[i]); //从每个点出发找出路径长度 } for(int i=1;i<=s;i++){ if(map[a[i].x][a[i].y]=='S'){ //找到S点,从S点出发进行prim cout<<prim(i)<<endl; break; } } } return 0;}
0 0
- POJ 3026
- poj-3026
- poj 3026
- POJ 3026
- POJ - 3026
- poj 3026
- poj 3026 Borg Maze
- POJ 3026 Borg Maze
- POJ 3026 Borg Maze
- poj 3026 Borg Maze
- poj-3026-Borg Maze
- POJ 3026 Borg Maze
- POJ 3026 Borg Maze
- poj 3026 Borg Maze
- POJ-3026-Borg Maze
- poj 3026 Borg Maze
- POJ 3026 Borg Maze
- POJ 3026 Borg Maze
- poj 3696 The Luckiest number(欧拉函数)
- cassandra学习笔记二
- Linux新一代文件系统Ext4剖析
- UVA 11488 - Hyper Prefix Sets(Trie)
- 华为机试题--任务调度问题
- poj 3026
- JavaWeb入门:JDBC连接数据库
- POJ 3687 Labeling Balls
- MSSQL 修改数据库de排序规
- 四舍五入算法
- Java代理学习笔记(静态代理&动态代理)
- mac下面使用nc命令传文件
- HDU-2159--FATE (完全背包)
- 12种设计模式c++源码