hdu1162 Eddy's picture 最小生成树 prim
来源:互联网 发布:java高并发架构 编辑:程序博客网 时间:2024/06/05 14:55
Eddy's picture
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10218 Accepted Submission(s): 5162
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: 1102 1217 1598 1596 1116
如果能用一句话形容我现在的心情 我真想说 :我真是日了狗了。。。
一天一道题没做出来 只能虐虐水题 心情不爽 很想发泄
#include <stdio.h>#include <math.h>#define inf 0x3fffffffstruct node{double x,y;}p[105];int n;double line[105][105];double getDist(node p1,node p2){return sqrt(pow(p1.y-p2.y,2)+pow(p1.x-p2.x,2));}void prim(){double dist[105];for(int i=0;i<n;i++)dist[i]=inf;int now=0;double ans=0;for(int i=0;i<n-1;i++){for(int j=0;j<n;j++){if(dist[j]!=-1&&dist[j]>line[now][j]){dist[j]=line[now][j];}}dist[now]=-1;double min=inf;int x;for(int j=0;j<n;j++){if(dist[j]!=-1&&min>dist[j]){min=dist[j];x=j;}}now=x;ans+=min;}printf("%.2lf\n",ans);}int main(){while(~scanf("%d",&n)){for(int i=0;i<n;i++){scanf("%lf %lf",&p[i].x,&p[i].y);}for(int i=0;i<n;i++){line[i][i]=inf;for(int j=i+1;j<n;j++){line[i][j]=line[j][i]=getDist(p[i],p[j]);}}prim();}}
0 0
- hdu1162 Eddy's picture (prim最小生成树)
- hdu1162 Eddy's picture (最小生成树之prim 算法)
- HDU1162 Eddy's picture 【最小生成树Prim】
- HDU1162-Eddy's picture-最小生成树(prim算法模板)
- hdu1162 Eddy's picture 最小生成树 prim
- HDU1162 Eddy's picture 最小生成树
- hdu1162 Eddy's picture 并查集+最小生成树
- HDU1162 Eddy's picture【Prim】
- hdu1162 Eddy's picture(prim模板)
- hdu 1162 Eddy's picture(最小生成树Prim算法)
- hdu 1162 Eddy's picture(最小生成树prim)
- HDOJ 1162 Eddy's picture(最小生成树prim算法)
- HDOJ 1162 Eddy's picture 最小生成树 Kruscal && Prim
- HDU 1162 Eddy's picture(最小生成树-Prim)
- hdoj 1162 Eddy's picture【最小生成树 kruskal && prim】
- hdu 1162 Eddy's picture(最小生成树,prim)
- hdu1162 Eddy's picture(图论:最小生成树-minimal spanning tree)
- hdu1162(并查集+Kruskal最小生成树)-- Eddy's picture
- vue2.0父子组件间通信
- va_start和va_end使用详解
- populating-next-right-pointers-in-each-node
- vim编辑器中如何查找某个词
- vue.js 实现 todo list 任务表单-2
- hdu1162 Eddy's picture 最小生成树 prim
- READING NOTE: FastMask: Segment Multi-scale Object Candidates in One Shot
- 新水手上船
- Java垃圾回收
- RNN时间序列预测(1)-Tensorflow入门,MNIST学习
- LeetCode 141 Linked List Cycle(链表判环)
- C++ 复制字符串/字符数组
- 巧用模板,不仅能提升AS开发效率,还能装逼
- Linux Kernel 学习笔记4:自动创建设备节点