生成树(ST)练习专题

内容包括：最小生成树、最大生成树、单度限制最小生成树

简单（没写题解）：

POJ-1252 Jungle Roads

POJ-2031 Building a Space Station

POJ-2421 Constructing Roads

POJ-1751 Highways

ZOJ-1586 QS Network

目录

中等：

HDU-2489 Minimal Ratio Tree(MinST + prim)

HDU-4786 Fibonacci Tree(Min + Max ST)

HDU-6187 Destroy Walls(MAX ST)

POJ-2031 Building a Space Station(Min ST)

POJ-3723 Conscription(Max ST)

POJ-2349 Arctic Network(MIn ST)

较困难：

Codeforces-125E MST Company(Min ST + Binary Search)

HDU-3938 Portal(Min ST)

---

 

HDU-2489 Minimal Ratio Tree(MinST + prim)

题意：给定一张完全图，每个结点和每条边都有一个权值，要求找到有m个结点的子图的最小比率生成树，如果有多颗，输出选择结点序号升序排序后字典序最小的树。生成树比率的计算为：边权值和/结点权值和

思路：结点总数只有15个，所以可以暴力枚举所有结点的选取情况，选择其中满足选取了m个结点的条件后，对这m个结点跑最小生成树算法，由于子图也为完全图，所以用prim算法更简单。

AC代码：

/*---------------------------------
 *File name: 生成树-div2-F-Minimal_Ratio_Tree.cpp
 *Creation date: 2020-05-27 12:05
 *-------------------------------*/
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<vector>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#define fi first
#define se second
#define pb push_back
#define LL long long
#define PII pair<int, int>
#define Pque priority_queue 
#define loop(c, a, b) for(int c = a; c <= b; ++c)
using namespace std;
const int maxn = 1e5 + 5;
const int inf = 0x3f3f3f3f;
const LL mod = 1e9 + 7;

int n, m;
int Node_weight[20];
int Edge[20][20];
bool vis[20];
int dis[20];

inline bool check(int x){
	int cnt = 0;
	while(x) cnt += (x & 1), x >>= 1;
	return cnt == m;
}

inline int prim(vector<int> G){
	int ans = 0;
	int cnt = 0;
	memset(vis, 0, sizeof(vis));
	memset(dis, inf, sizeof(dis));
	vis[G[0]] = 1;
	int s = G[0];
	while(1){
		int Mind = inf;
		int x;
		for(int j = 0; j < G.size(); ++j){
			if(!vis[G[j]]){
				if(dis[G[j]] > Edge[s][G[j]]) dis[G[j]] = Edge[s][G[j]];
				if(Mind > dis[G[j]]) Mind = dis[G[j]], x = G[j];
			}
		}
		s = x;
		vis[s] = 1;
		cnt++;
		ans += Mind;
		if(cnt == G.size() - 1) break;
	}
	return ans;
}

int main(){
	while(~scanf("%d %d", &n, &m) && n && m){
		for(int i = 1; i <= n; ++i) scanf("%d", &Node_weight[i]);
		for(int i = 1; i <= n; ++i) for(int j = 1; j <= n; ++j) scanf(" %d", &Edge[i][j]);
		int up = (1 << n);
		int MinNodeW = -1, MinEdgeW = -1;
		vector<int> ans;
		for(int i = 3; i < up; ++i){
			if(!check(i)) continue;
			vector<int> Node;
			int cnt = 1;
			int x = i;
			int weight_Node = 0;
			while(x){
				if(x & 1) Node.pb(cnt), weight_Node += Node_weight[cnt];
				cnt++;
				x >>= 1;
			}
			int weight_Edge = prim(Node);
			if(MinNodeW == -1){
				MinNodeW = weight_Node, MinEdgeW = weight_Edge;
				ans = Node;
			}
			else if(weight_Edge * MinNodeW < weight_Node * MinEdgeW){
				MinNodeW = weight_Node;
				MinEdgeW = weight_Edge;
				ans = Node;
			}
			else if(weight_Edge * MinNodeW == weight_Node * MinEdgeW){
				if(ans > Node) ans = Node;
			}
		}
		for(int i = 0; i < m; ++i) printf("%d%c", ans[i], i == m - 1 ? '\n' : ' ');
	}
	return 0;
}

HDU-4786 Fibonacci Tree(Min + Max ST)

题意：给定一张n点m边的图，问是否存在一颗生成树的权值为斐波那契数（1，2，3，5，8....）。边权仅为0和1。

思路：跑两边Kruskal分别计算最小生成树和最大生成树的权值，如果有斐波那契数小于最大权值且大于最小权值则存在。

AC代码：

/*---------------------------------
 *File name: 生成树-div2-D-Fibonacci_Tree.cpp
 *Creation date: 2020-05-27 11:02
 *-------------------------------*/
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<vector>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#inc