hdoj--1162--Eddy's picture(最小生成树)
来源:互联网 发布:入侵棋牌游戏数据库 编辑:程序博客网 时间:2024/05/16 10:41
Eddy's picture
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8562 Accepted Submission(s): 4339
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
Author
eddy
Recommend
JGShining | We have carefully selected several similar problems for you: 1217 1142 1213 1325 1856
#include<stdio.h>#include<math.h>#include<string.h>#include<algorithm>using namespace std;struct node{int x,y;double val;}edge[100100];double x[10010],y[10010];int cmp(node s1,node s2){if(s1.val<s2.val)return 1;return 0;}int pre[10010];void init(){for(int i=0;i<10010;i++)pre[i]=i;}int find(int x){return pre[x]==x?x:pre[x]=find(pre[x]);}int main(){int n;while(scanf("%d",&n)!=EOF){for(int i=0;i<n;i++)scanf("%lf%lf",&x[i],&y[i]);int cnt=0;init();for(int i=0;i<n;i++){for(int j=0;j<n;j++){if(i==j) continue;edge[cnt].x=i;edge[cnt].y=j;edge[cnt++].val=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));}}sort(edge,edge+cnt,cmp);double sum=0;for(int i=0;i<cnt;i++){int fx=find(edge[i].x);int fy=find(edge[i].y);if(fx!=fy){sum+=edge[i].val;pre[fx]=fy;}}printf("%.2lf\n",sum);}return 0;}
0 0
- HDOJ 1162:Eddy's picture 求解最小生成树
- HDOJ 1162 Eddy's picture(最小生成树 - kruskal)
- HDOJ 题目1162 Eddy's picture(最小生成树)
- hdoj 1162 Eddy's picture 【最小生成树】
- hdoj 1162 Eddy's picture(最小生成树)
- HDOJ 1162 Eddy's picture(最小生成树--kruskal)
- HDOJ 1162 Eddy's picture(最小生成树prim算法)
- hdoj 1162 Eddy's picture【最小生成树】
- HDOJ 1162 Eddy's picture 最小生成树 Kruscal && Prim
- HDOJ 1162 Eddy's Picture (最小生成树)
- hdoj--1162--Eddy's picture(最小生成树)
- hdoj 1162 Eddy's picture【最小生成树 kruskal && prim】
- HDOJ 1162 Eddy's picture(最小生成树)
- HDOJ 1162 Eddy's picture 最小生成树
- HDOJ 1198 Eddy's picture 最小生成树
- Eddy's picture(最小生成树)
- HDU1162 Eddy's picture 最小生成树
- hdu 1162 Eddy's picture(最小生成树Prim算法)
- eclipse注释模板
- AndroidStudio 配置Git 及提交项目至Githup
- 导航条固定
- java中的string[] args
- 一致性哈希算法
- hdoj--1162--Eddy's picture(最小生成树)
- 使用Navicat for Oracle工具连接oracle的图文教程
- 安卓TobHost实现TabBar
- 出现“org.hibernate.QueryException: could not resolve property”错误的解决
- js非空判断
- 迁移学习(Transfer Learning)TL
- Educational Codeforces Round 5 总结
- C#中方法参数 ref 与 out 的区别
- Android蓝牙开发浅析