Borg Maze

Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 8905   Accepted: 2969

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.

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

2
6 5
#####
#A#A##
# # A#
#S ##
#####
7 7
#####
#AAA###
# A#
# S ###
# #
#AAA###
#####

Sample Output

8
11 思路:bfs得外星人间最小距离(假设人类是第0号外星人),prim得最小生成树
#include<cstdio>
#include <cstring>
#include <queue>
#include <assert.h>
using namespace std;
char maz[202][202];
bool vis[202][202];
int d[201][202][202];
int alien[201][2];
int numa;
int x,y;
int sx,sy;
int e[202][202];
typedef pair<int,int> P;
queue<P> que;
const int dx[4]={0,0,-1,1};
const int dy[4]={-1,1,0,0};
bool used[101];
void bfs(){
sx=sy=-1;//处理迷宫
numa=0;
memset(vis,0,sizeof(vis));
for(int i=0;i<y;i++){
for(int j=0;j<x;j++){
if(maz[i][j]=='S'){
sx=j;
sy=i;
break;
}
}
}
assert(sx!=-1&&sy!=-1);
vis[sy][sx]=true;
d[0][sy][sx]=0;
alien[numa][0]=sy;
alien[numa++][1]=sx;
que.push(P(sy,sx));
while(!que.empty()){//从人类出发bfs
P p=que.front();
que.pop();
for(int i=0;i<4;i++){
int ny=p.first+dy[i];
int nx=p.second+dx[i];
if(nx>=0&&nx<x&&ny>=0&&ny<y&&!vis[ny][nx]&&maz[ny][nx]!='#'){
d[0][ny][nx]=d[0][p.first][p.second]+1;
vis[ny][nx]=true;
que.push(P(ny,nx));
if(maz[ny][nx]=='A'){
alien[numa][0]=ny;
alien[numa++][1]=nx;
}
}
}
}
for(int ai=1;ai<numa;ai++){//从每个外星人出发bfs
memset(vis,0,sizeof(vis));
int ay=alien[ai][0],ax=alien[ai][1];
d[ai][ay][ax]=0;
que.push(P(ay,ax));
vis[ay][ax]=true;
while(!que.empty()){
P p=que.front();
que.pop();
for(int i=0;i<4;i++){
int ny=p.first+dy[i];
int nx=p.second+dx[i];
if(nx>=0&&nx<x&&ny>=0&&ny<y&&!vis[ny][nx]&&maz[ny][nx]!='#'){
d[ai][ny][nx]=d[ai][p.first][p.second]+1;
vis[ny][nx]=true;
que.push(P(ny,nx));
}
}
}
}
for(int i=0;i<numa;i++){//建图
//int ay=alien[i][0],ax=alien[i][1];
for(int j=0;j<numa;j++){
int ay1=alien[j][0],ax1=alien[j][1];
e[i][j]=d[i][ay1][ax1];
}
}
}
priority_queue <P,vector<P>, greater <P> > pque;
int prim(){
memset(used,0,sizeof(used));
used[0]=true;
int unum=1;
for(int i=1;i<numa;i++){
pque.push(P(e[0][i],i));
}
int ans=0;
while(unum<numa){
int t=pque.top().second;
int td=pque.top().first;
pque.pop();
if(used[t])continue;
ans+=td;
used[t]=true;
unum++;
for(int i=0;i<numa;i++){
if(!used[i]){
pque.push(P(e[t][i],i));
}
}
}
while(!pque.empty())pque.pop();
return ans;
}
int main(){
int t;
scanf("%d",&t);
while(t--){
scanf("%d%d",&x,&y);
gets(maz[0]);//抛弃空行
for(int i=0;i<y;i++){
gets(maz[i]);
}
bfs();
int ans=prim();
printf("%d\n",ans);
}
}

  

快速切题 poj 3026 Borg Maze 最小生成树+bfs prim算法 难度:0的更多相关文章

  1. poj 3026 Borg Maze (最小生成树+bfs)

    有几个错误,调试了几个小时,样例过后 1Y. 题目:http://poj.org/problem?id=3026 题意:就是让求A们和S的最小生成树 先用bfs找每两点的距离,再建树.没剪枝 63MS ...

  2. poj 3026 Borg Maze 最小生成树 + 广搜

    点击打开链接 Borg Maze Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 7097   Accepted: 2389 ...

  3. POJ 3026 Borg Maze【BFS+最小生成树】

    链接: http://poj.org/problem?id=3026 http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22010#probl ...

  4. POJ 3026 Borg Maze(bfs+最小生成树)

    Borg Maze Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 6634   Accepted: 2240 Descrip ...

  5. POJ 3026 --Borg Maze(bfs,最小生成树,英语题意题,卡格式)

    Borg Maze Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 16625   Accepted: 5383 Descri ...

  6. 快速切题 poj 2993 Emag eht htiw Em Pleh 模拟 难度:0

    Emag eht htiw Em Pleh Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 2806   Accepted:  ...

  7. poj 3026 Borg Maze (BFS + Prim)

    http://poj.org/problem?id=3026 Borg Maze Time Limit:1000MS     Memory Limit:65536KB     64bit IO For ...

  8. POJ 3026 : Borg Maze(BFS + Prim)

    http://poj.org/problem?id=3026 Borg Maze Time Limit: 1000MS   Memory Limit: 65536K Total Submissions ...

  9. POJ - 3026 Borg Maze BFS加最小生成树

    Borg Maze 题意: 题目我一开始一直读不懂.有一个会分身的人,要在一个地图中踩到所有的A,这个人可以在出发地或者A点任意分身,问最少要走几步,这个人可以踩遍地图中所有的A点. 思路: 感觉就算 ...

随机推荐

  1. 手机端1px细线公共类

    手机端1px细线公共类 .borderBottom1px{ position: relative; } .borderBottom1px:after{ content: ""; p ...

  2. Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) C - Jon Snow and his Favourite Number

    地址:http://codeforces.com/contest/768/problem/C 题目: C. Jon Snow and his Favourite Number time limit p ...

  3. springCloud4---feign

    JAX-WS : soap是遵循这个标准. JAX-RS : 标准,jersey框架遵循这个标准. Feign是一个声明式的web service客户端.Feign使用的负载均衡也是ribbon,Fe ...

  4. netty11---管道

    客户端: package com.server; import java.net.Socket; public class Client { public static void main(Strin ...

  5. netty6---序列化与反序列化

    package com.cn; import java.io.ByteArrayInputStream; import java.io.ByteArrayOutputStream; import ja ...

  6. 【Head First Servlets and JSP】笔记 27: web 应用安全

    典型的安全问题:假冒者.窃听者.非法升级者 认证方式: Base64 .摘要认证 .客户端证书.表单认证,重点熟悉摘要算法( HASH . MD5 等) 安全机制:授权.认证.数据完整性.机密性 80 ...

  7. linux下 安装php的gettext模块

    安装php的模块有两种方式: 一.重新编译php,加上--with-gettext 二.动态安装 现在说下第二个动态安装 1.下载同版本的php原包,解压后进入ext目录,目录下便是模块 2.进入ge ...

  8. Web前端开发学习笔记(一)

    最近在复习Web前端的开发知识,于是就把大二上学期曾经学过的东西拿出来复习一遍,把自己在做曾经的作业时遇到有意义的点都记下来吧. Homework1:http://my.ss.sysu.edu.cn/ ...

  9. 20145302张薇 Java第一周学习总结

    20145302张薇 <Java程序设计>第一周学习总结 教材学习内容总结 第一章 1995年,java被公认诞生.java第一开始为了消费性数字产品(如手机)而设计,所以java本身有很 ...

  10. 百度开源分布式id生成器uid-generator源码剖析

    百度uid-generator源码 https://github.com/baidu/uid-generator snowflake算法 uid-generator是基于Twitter开源的snowf ...