#最小生成树#poj 1639 Picnic Planning

题目

一个n个点m条边的无向图，求它的最小生成树，且满足1号节点的度数不超过给定的整数

---

分析

那么把这个最小生成树拆开，分成了许多连通块，在这些连通块中找到子最小生成树，然后再深搜尝试用其它点连向一号节点

---

WA代码(带注释)

#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#define rr register
using namespace std;
struct node{
	int x,y,w;
	bool operator <(const node &t)const{
	    return w<t.w;
	}
}dp[21];
vector<node>ed; map<string,int>uk;
int n,m,f[21],minx[21],dis[21][21],k,ans; bool vis[21][21];
inline int getf(int u){return (f[u]==u)?u:f[u]=getf(f[u]);}
inline void dfs(int x,int pre){
	for (rr int i=2;i<=n;++i)
	if (i!=pre&&vis[x][i]){
		if (dp[i].w==-1)
			if (dp[x].w>dis[x][i]) dp[i]=dp[x];//求最小的方案
			else dp[i]=(node){x,i,dis[x][i]};//存下最优的方案是x到i的边
		dfs(i,x);
	}
}
inline void answ(){
	rr int poi[21];
	for (rr int i=2;i<=n;++i)//找到连通块内连接点1的最短边
	if (dis[1][i]!=2333){
		rr int ff=getf(i);
		if (minx[ff]>dis[1][i]){
			minx[ff]=dis[1][i];
			poi[ff]=i;
		}
	}
	for (rr int i=2;i<=n;++i)//标记可走边
	if (minx[i]!=2333){
		++m;
		vis[1][poi[i]]=vis[poi[i]][1]=1;
		ans+=dis[1][poi[i]];
	}
	for (rr int i=m+1;i<=k;++i){
		for (rr int j=1;j<21;++j) dp[j]=(node){-1,-1,-1};
		dp[1].w=-2333;
		for (rr int j=2;j<=n;++j) if (vis[1][j]) dp[j].w=-2333;
		dfs(1,-1);
		rr int k,minxx=2333;
		for (rr int j=2;j<=n;++j)//找到最小差值
		if (minxx>dis[1][j]-dp[j].w)
		    minxx=dis[1][j]-dp[j].w,k=j;
		if (minxx>=0) break;
		vis[1][k]=vis[k][1]=1;
		vis[dp[k].x][dp[k].y]=vis[dp[k].y][dp[k].x]=0;//替换边
		ans+=minxx;
	}
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	uk["Park"]=++n;
	for (rr int i=1;i<21;++i)
	for (rr int j=1;j<21;++j) dis[i][j]=2333;
	for (rr int i=1;i<21;++i) minx[i]=2333,f[i]=i;
	for (cin>>m;m;--m){
		rr string s1,s2; rr int u,v,w;
		cin>>s1>>s2>>w;
		if (uk.find(s1)==uk.end()) uk[s1]=++n;
		if (uk.find(s2)==uk.end()) uk[s2]=++n;
		u=uk[s1]; v=uk[s2];
		ed.push_back((node){u,v,w});
		dis[u][v]=dis[v][u]=min(dis[u][v],w);
	}
	cin>>k; sort(ed.begin(),ed.end());
	for (rr int i=0;i<ed.size();++i){//kruskal求出最小生成树
		rr int u=ed[i].x,v=ed[i].y;
		if (u==1||v==1) continue;
		if (getf(u)!=getf(v)){
			f[getf(u)]=getf(v);
			vis[u][v]=vis[v][u]=1;//标记可走边
			ans+=ed[i].w;
		}
	}
	answ();
	cout<<"Total miles driven: "<<ans<<endl;
	return 0;
}

---

AC代码（不带注释）

#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#define rr register
using namespace std;
const int inf=707406378;
struct node{
	int x,y,w;
	bool operator <(const node &t)const{
	    return w<t.w;
	}
}dp[25];
vector<node>ed; map<string,int>uk;
int n,m,f[25],minx[25],dis[25][25],k,ans; bool vis[25][25];
inline int getf(int u){return (f[u]==u)?u:f[u]=getf(f[u]);}
inline void dfs(int x,int pre){
	for (rr int i=2;i<=n;++i)
	if (i!=pre&&vis[x][i]){
		if (dp[i].w==-1){
			if (dp[x].w>dis[x][i]) dp[i]=dp[x];
			else dp[i]=(node){x,i,dis[x][i]};
		}
		dfs(i,x);
	}
}
inline void answ(){
	rr int poi[25];
	for (rr int i=2;i<=n;++i)
	if (dis[1][i]!=inf){
		rr int ff=getf(i);
		if (minx[ff]>dis[1][i]){
			minx[ff]=dis[1][i];
			poi[ff]=i;
		}
	}
	for (rr int i=2;i<=n;++i)
	if (minx[i]!=inf){
		++m;
		vis[1][poi[i]]=vis[poi[i]][1]=1;
		ans+=dis[1][poi[i]];
	}
	for (rr int i=m+1;i<=k;++i){
		for (rr int j=1;j<25;++j) dp[j]=(node){-1,-1,-1};
		dp[1].w=-inf;
		for (rr int j=2;j<=n;++j) if (vis[1][j]) dp[j].w=-inf;
		dfs(1,-1);
		rr int k,minxx=inf;
		for (rr int j=2;j<=n;++j)
		if (minxx>dis[1][j]-dp[j].w)
		    minxx=dis[1][j]-dp[j].w,k=j;
		if (minxx>=0) break;
		vis[1][k]=vis[k][1]=1;
		vis[dp[k].x][dp[k].y]=vis[dp[k].y][dp[k].x]=0;
		ans+=minxx;
	}
}
int main(){
	uk["Park"]=++n;
	for (rr int i=1;i<25;++i)
	for (rr int j=1;j<25;++j) dis[i][j]=inf;
	for (rr int i=1;i<25;++i) minx[i]=inf,f[i]=i;
	for (cin>>m;m;--m){
		rr string s1,s2; rr int u,v,w;
		cin>>s1>>s2>>w;
		if (uk.find(s1)==uk.end()) uk[s1]=++n;
		if (uk.find(s2)==uk.end()) uk[s2]=++n;
		u=uk[s1]; v=uk[s2];
		ed.push_back((node){u,v,w});
		dis[u][v]=dis[v][u]=min(dis[u][v],w);
	}
	cin>>k; sort(ed.begin(),ed.end());
	for (rr unsigned i=0;i<ed.size();++i){
		rr int u=ed[i].x,v=ed[i].y;
		if (u==1||v==1) continue;
		rr int fa=getf(u),fb=getf(v);
		if (fa!=fb){
			f[min(fa,fb)]=max(fa,fb);
			vis[u][v]=vis[v][u]=1;
			ans+=ed[i].w;
		}
	}
	answ();
	cout<<"Total miles driven: "<<ans<<endl;
	return 0;
}