HDU 1162.Eddy's picture【最小生成树(Kruskal算法)】【5月30】
来源:互联网 发布:aspnet源码怎么搭建 编辑:程序博客网 时间:2024/06/06 12:46
Eddy's picture
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8871 Accepted Submission(s): 4516
Problem Description
Eddy begins to like painting pictures recently ,he is sure of himself to become a painter.Every day Eddy draws pictures in his small room, and he usually puts out his newest pictures to let his friends appreciate. but the result it can be imagined, the friends are not interested in his picture.Eddy feels very puzzled,in order to change all friends 's view to his technical of painting pictures ,so Eddy creates a problem for the his friends of you.
Problem descriptions as follows: Given you some coordinates pionts on a drawing paper, every point links with the ink with the straight line, causes all points finally to link in the same place. How many distants does your duty discover the shortest length which the ink draws?
Problem descriptions as follows: Given you some coordinates pionts on a drawing paper, every point links with the ink with the straight line, causes all points finally to link in the same place. How many distants does your duty discover the shortest length which the ink draws?
Input
The first line contains 0 < n <= 100, the number of point. For each point, a line follows; each following line contains two real numbers indicating the (x,y) coordinates of the point.
Input contains multiple test cases. Process to the end of file.
Input contains multiple test cases. Process to the end of file.
Output
Your program prints a single real number to two decimal places: the minimum total length of ink lines that can connect all the points.
Sample Input
31.0 1.02.0 2.02.0 4.0
Sample Output
3.41
#include<iostream>#include<cstdio>#include<cmath>#include<algorithm>using namespace std;const int MAX = 105;struct Node{ double x, y;}N[MAX];struct Len{ int nodex, nodey; double len; bool operator< (const Len a) const { return len < a.len; }}L[MAX*MAX];double dis(Node a, Node b){ return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));}int n, k, fa[MAX];int fi(int x){ if(fa[x] == x) return x; else return fa[x] = fi(fa[x]);}double ans;int main(){ while(scanf("%d", &n) != EOF) { k = 0; ans = 0; for(int i = 0;i <= MAX; ++i) fa[i] = i; for(int i = 0;i < n; ++i) { scanf("%lf %lf", &N[i].x, &N[i].y); for(int j = 0;j < i; ++j) { L[k].nodex = i; L[k].nodey = j; L[k++].len = dis(N[i], N[j]); } } sort(L, L+k); for(int i = 0;i < k; ++i) { int x = fi(L[i].nodex); int y = fi(L[i].nodey); if(x == y) continue; fa[x] = y; ans += L[i].len; } printf("%.2f\n", ans); } return 0;}
(省赛快到了~主场作战,还是没底~~~)
0 0
- HDU 1162.Eddy's picture【最小生成树(Kruskal算法)】【5月30】
- HDU-1162 Eddy's picture(最小生成树[Kruskal])
- hdu 1162 Eddy's picture (Kruskal算法,prim算法,最小生成树)
- hdu 1162 Eddy's picture(最小生成树之kruskal算法)
- hdu 1162 Eddy's picture(最小生成树Kruskal)
- HDU 1162 Eddy's picture【最小生成树,Prime算法+Kruskal算法】
- hdu 1162 Eddy's picture 最小生成树入门题 Prim+Kruskal两种算法AC
- HDOJ 1162 Eddy's picture(最小生成树 - kruskal)
- HDU-1875 畅通工程再续-1162 - Eddy's picture(最小生成树,Kruskal 算法实现 )
- hdu 1162 Eddy's picture(最小生成树Prim算法)
- hdu 1162 Eddy's picture(最小生成树算法)
- Eddy's picture 最小生成数 kruskal
- HDOJ 1162 Eddy's picture(最小生成树--kruskal)
- hdoj 1162 Eddy's picture【最小生成树 kruskal && prim】
- hdu 1162 Eddy's picture(最小生成树)
- hdu 1162 Eddy's picture(基础最小生成树)
- HDU 1162 Eddy's picture(图论-最小生成树)
- HDU 1162 Eddy's picture(最小生成树-Prim)
- 移动端后台接口约定
- leetcode evaluate-reverse-polish-notation
- WKWebView加载Http页面更新后不刷新问题及解决办法
- hdu 1160 FatMouse's Speed(DP)
- 网络程序设计-为多个客户服务服务器端设计
- HDU 1162.Eddy's picture【最小生成树(Kruskal算法)】【5月30】
- 打印杨辉三角
- 第十、十一周项目1:阅读程序,并写出运行结果(2)
- 51 nod 最高的奖励
- 『数据挖掘』scikit-learn包的进阶学习笔记——第二章:线性回归
- 把普通的java对象转成json字符串
- Android网络切换状态广播
- 第十、十一周项目1:阅读程序,并写出运行结果(3)
- 微信浏览器如何禁止iPhone手机上下滑动网页