POJ 1251 Jungle Roads

题意：给你n个点 n-1行每行代表的是这个点到给定点的距离求最短路

解题思路：开始是用getchar 发现runtime error 后来用了字符串才改进了裸Kruskal

解题代码：

poj 1251

// File Name: c.cpp
// Author: darkdream
// Created Time: 2013年04月24日 星期三 22时43分39秒

#include<vector>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<ctime>using namespace std;int p[100005];
int v[100005];
int u[100005];
int r[100005];
int w[100005];
int find(int x)
{return  p[x] == x? x:p[x] =find(p[x]);
}
int cmp(const int i, const int j )
{return w[i] < w[j];
}
char str[100];
int main(){int n ;while(scanf("%d",&n) !=  EOF){memset(p,0,sizeof(p));memset(r,0,sizeof(r));memset(v,0,sizeof(v));memset(u,0,sizeof(u));memset(w,0,sizeof(w));if(n == 0 )break;int m = 0;for(int s = 1;s <n; s++){  char c;int k ;scanf("%s",str);c = str[0];scanf("%d",&k);for(int i = 1;i <= k ; i ++){char tempc;int temp;scanf("%s",str);tempc = str[0];scanf("%d",&temp);v[++m] = c-'A' +1;u[m] = tempc -'A'+1;w[m] = temp;}}//for(int i =1;i <= m ;i ++)//    printf("%d %d\n",v[i],u[i]);for(int i = 1;i <=n ;i ++)p[i] = i ;for(int i = 1 ;i <= m  ;i ++)r[i] = i ;sort(r+1,r+m+1,cmp);//    for(int i =1 ;i <= m; i ++)//        printf("%d\n",r[i]);int ans = 0;for(int i =1 ;i <= m;i ++){int e = r[i];int x = find(v[e]); int y = find(u[e]);//int x = 0 , y = 0;if(x != y){ans += w[e];p[x] = y;}}printf("%d\n",ans);}return 0;
}

转载于:https://www.cnblogs.com/zyue/archive/2013/04/25/3042355.html

POJ 1251 Jungle Roads相关推荐

poj 1251 Jungle Roads
#include <iostream> // 最小生成树kruskal算法#include <algorithm>using namespace std;const int m ...
POJ - 1251(最小生成树.krustal)
题目链接:http://poj.org/problem?id=1251 题目: Jungle Roads Time Limit: 1000MS Memory Limit: 10000K Total ...
Jungle Roads丛林道路（最小生成树PrimKruskal算法)
Jungle Roads丛林道路 POJ - 1251 目录 Jungle Roads丛林道路题意描述 Kruskal算法解题思路 Kruskal AC代码 Prim 解题思路 AC代码 The H ...
HDU 1301 Jungle Roads(裸最小生成树）
题目链接今天做了好几个模版最小生成树...贴一个kurskral. 1 /* 2 HDU 1301 Jungle Roads 3 最小生成树Kurskal模版 4 */ 5 #include < ...
【HDU - 1301】Jungle Roads（并查集+最小生成树）（内附最小生成树两种算法克鲁斯特尔算法amp;amp;普里姆算法）
题干: Jungle Roads Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) ...
HDU 1815， POJ 2749 Building roads（2-sat）
HDU 1815, POJ 2749 Building roads 题目链接HDU 题目链接POJ 题意: 有n个牛棚, 还有两个中转站S1和S2, S1和S2用一条路连接起来. 为了使得随意牛棚两个 ...
* poj 1251 JungleRoad 最小生成树 Kruskal算法、Prim算法
文章目录 Kruskal算法模板:https://blog.csdn.net/Rain722/article/details/65642992 Prim算法模板: poj 1251 JungleR ...
Jungle Roads//最小生成树kruskal
题目: Jungle Roads Time Limit: 2 Seconds Memory Limit: 65536 KB The Head Elder of the tropical is ...
题目1154：Jungle Roads
题目描述: The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money ...

POJ 1251 Jungle Roads

POJ 1251 Jungle Roads相关推荐

最新文章

热门文章