poj_3026

源地址：http://poj.org/problem?id=3026

题意真是不好懂。。

解法倒是不是很难，先用bfs求出任意两个字母之间的最短距离，抽象成一个图中的两个点之间边的权值，然后用最小生成树求其总的权值。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
#define ll __int64
int n,m;
#define Mod 1000000007
#define N 1010
#define M 1000010
char mp[N][N];
int isLegal[N][N];
int path[N][N];
int dis[N];
int vis[N][N];
int vis1[N];
int num;
int dirx[4] = {1,-1,0,0};
int diry[4] = {0,0,1,-1};
struct Node{
	int x,y;
	int step;
};
bool check(int x,int y){
	if(x<0||x>=n||y<0||y>=m||mp[x][y] == '#')
		return false;
	return true;
}
void bfs_getDis(int x,int y){
	queue<Node> q;
	memset(vis,0,sizeof vis);
	vis[x][y] = 1;
	path[isLegal[x][y]][isLegal[x][y]] = 0;
	Node cur,next;
	cur.x = x;
	cur.y = y;
	cur.step = 0;
	q.push(cur);
	while(!q.empty()){
		cur = q.front();
		q.pop();
		for(int i=0;i<4;i++){
			next.x = cur.x+dirx[i];
			next.y = cur.y+diry[i];
			if(!check(next.x,next.y)) continue;
			if(vis[next.x][next.y]) continue;
			vis[next.x][next.y] = 1;
			next.step = cur.step + 1;
			q.push(next);
			if(isLegal[next.x][next.y]){ //record the distance between (x,y) and (next.x,next.y)
				path[isLegal[x][y]][isLegal[next.x][next.y]] = next.step;
			}
		}
	}
}
void Prim(){
	memset(vis1,0,sizeof vis1);
	for(int i=1;i<=num;i++)	//there are totally num nodes and numbered from 1 to num
		dis[i] = path[1][i];
	int ans = 0;
	for(int i=0;i<num;i++){
		int mmin = INF;
		int flag = -1;
		for(int j=1;j<=num;j++)
			if(!vis1[j]&&mmin>dis[j])
				mmin = dis[flag=j];
		if(flag == -1) break;
		vis1[flag] = 1;
		ans += mmin;
		for(int j=1;j<=num;j++)
			if(!vis1[j] && path[flag][j]<dis[j])
				dis[j] = path[flag][j];
	}
	printf("%d\n",ans);
}
int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
#endif
  int t;
  sf(t);
  char tmp[110];
  while(t--){
	  sfd(m,n);
	  memset(isLegal,0,sizeof isLegal);
	  gets(tmp);
	  num = 0;
	  for(int i=0;i<n;i++){
		  gets(mp[i]);
		  for(int j=0;j<m;j++){
			  if(mp[i][j]>='A'&&mp[i][j]<='Z'){
				  isLegal[i][j] = ++num;
			  }
		  }
	  }
	 for(int i=0;i<n;i++)
		 for(int j=0;j<m;j++)
			 if(isLegal[i][j])	//if isLegal[i][j]>0,mp[i][j] ='S' or mp[i][j] = 'A'
				 bfs_getDis(i,j); //calculate the distance between (i,j) to the other  places
	 Prim();
  }
return 0;
}