POJ 1251 Jungle Roads (最小生成树 Kruskal克鲁斯卡尔算法)

最新推荐文章于 2020-03-19 23:22:22 发布

tiutiu2011

最新推荐文章于 2020-03-19 23:22:22 发布

阅读量395

点赞数

分类专栏： Talk is cheap Show me the code ACM-ICPC 文章标签： POJ 1251 Jungle Roads 最小生成树克鲁斯卡尔

本文链接：https://blog.csdn.net/tiutiu2011/article/details/48710787

版权

Talk is cheap Show me the code 同时被 2 个专栏收录

168 篇文章 0 订阅

订阅专栏

ACM-ICPC

154 篇文章 0 订阅

订阅专栏

本文介绍了一个使用快速排序和并查集实现的最小生成树算法。通过定义道路结构体，并运用快速排序对道路成本进行排序，确保了算法的高效运行。此外，通过并查集来避免形成环路，从而计算出连接所有村庄的最低成本路径。

摘要由CSDN通过智能技术生成

#include <stdio.h>

#define MAX_ROADS 76
#define MAX_VILLAGES 27

struct ROAD{
	int start;
	int end;
	int cost;
};

ROAD roadArray[MAX_ROADS];
int numOfRoads;
int roadNum;

int numOfVillages;

int parent[MAX_VILLAGES];

void roadCopy(ROAD *to, ROAD *from){
	ROAD temproad;
	temproad.start = from->start;
	temproad.end = from->end;
	temproad.cost = from->cost;
	from->start = to->start;
	from->end = to->end;
	from->cost = to->cost;
	to->start = temproad.start;
	to->end = temproad.end;
	to->cost = temproad.cost;
}
void quickSortroadsAccordingToCost(int start, int end){
	if (start >= end){
		return;
	}
	while (start < end){
		int left = start;
		int right = end;
		ROAD pivotroad;
		roadCopy(&pivotroad, &roadArray[start]);
		while (left < right){
			while (left < right && roadArray[right].cost >= pivotroad.cost){
				right--;
			}
			roadCopy(&roadArray[left], &roadArray[right]);
			while (left < right && roadArray[left].cost <= pivotroad.cost){
				left++;
			}
			roadCopy(&roadArray[right], &roadArray[left]);			
		}
		roadCopy(&roadArray[left], &pivotroad);
		int pivot = left;
		quickSortroadsAccordingToCost(start, pivot - 1);
		start = pivot + 1;
	}
}

int getParent(int villageNum){
	while (parent[villageNum]){
		villageNum = parent[villageNum];
	}
	return villageNum;
}
int main(){
	//freopen("input.txt", "r", stdin);

	while (1){
		scanf("%d", &numOfVillages);
		if (numOfVillages == 0){
			return 0;
		}

		numOfRoads = 0;
		int indexOfVillage;
		for (indexOfVillage = 1; indexOfVillage <= numOfVillages; indexOfVillage++){
			parent[indexOfVillage] = 0;
		}

		for (indexOfVillage = 1; indexOfVillage < numOfVillages; indexOfVillage++){
			char villageLetter;
			int numOfAdjaRoads;
			scanf(" %c %d", &villageLetter, &numOfAdjaRoads);
			int start = villageLetter - 'A' + 1;
			int indexOfRoad;
			for (indexOfRoad = 1; indexOfRoad <= numOfAdjaRoads; indexOfRoad++){
				int cost;
				scanf(" %c %d", &villageLetter, &cost);
				int end = villageLetter - 'A' + 1;
				numOfRoads++;
				roadNum = numOfRoads;
				roadArray[roadNum].start = start;
				roadArray[roadNum].end = end;
				roadArray[roadNum].cost = cost;
			}
		}

		quickSortroadsAccordingToCost(1, numOfRoads);

		int minTotalCost = 0;
		int indexOfRoad;
		for (indexOfRoad = 1; indexOfRoad <= numOfRoads; indexOfRoad++){
			int start = roadArray[indexOfRoad].start;
			int end = roadArray[indexOfRoad].end;
			int parentOfStart = getParent(start);
			int parentOfEnd = getParent(end);
			if ( parentOfStart != parentOfEnd ){
				parent[parentOfStart] = parentOfEnd;
				minTotalCost += roadArray[indexOfRoad].cost;
			}
		}

		printf("%d\n", minTotalCost);		
	}
}