【杭电oj】1162 - Eddy's picture(最小生成树)
来源:互联网 发布:淘宝知识产权投诉撤销 编辑:程序博客网 时间:2024/06/05 07:16
Eddy's picture
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8552 Accepted Submission(s): 4332
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
最小生成树,说实话,这道题起初还害怕会TLE,看来该学学评估时间了。
代码如下:
#include <stdio.h>#include <algorithm>#include <math.h>using namespace std;int set[1111];struct record{double x,y;}dot[111];struct str{int st,end;double length;}data[5000];bool cmp(str a,str b){return a.length<b.length;}int find(int x){int r=x;while (r!=set[r])r=set[r];int j=x;int i;while (j!=r){i=set[j];set[j]=r;j=i;}return r;}int join(int x,int y){int fx,fy;fx=find(x);fy=find(y);if (fx!=fy){set[fy]=fx;return 1;//不一棵树返回1 }return 0;}double dis(record a,record b){double tt;tt=sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));return tt;}int main(){int n;//村庄数double ans;int m;//m=n(n-1)/2while (~scanf ("%d",&n) && n) {for (int i=1;i<=n;i++)set[i]=i;ans=0;for (int i=1;i<=n;i++){scanf ("%lf%lf",&dot[i].x,&dot[i].y);}int num=1;for (int i=1;i<=n;i++){for (int j=i+1;j<=n;j++){data[num].st=i;data[num].end=j;data[num].length=dis(dot[i],dot[j]);num++;}}num--;sort(data+1,data+1+num,cmp);for (int i=1;i<=num;i++){if (join (data[i].st,data[i].end))//不在同一棵树,合并,并把距离记录 {ans+=data[i].length;}}printf ("%.2lf\n",ans);}return 0;}
0 0
- 杭电1162Eddy's picture(最小生成树)
- 【杭电oj】1162 - Eddy's picture(最小生成树)
- 杭电1162 Eddy's picture 最小生成树
- Eddy's picture 杭电oj 1162
- Eddy's picture(最小生成树)
- HDOJ 1162 Eddy's picture(最小生成树 - kruskal)
- hdu 1162 Eddy's picture(最小生成树)
- hdu 1162 Eddy's picture(基础最小生成树)
- HDOJ 题目1162 Eddy's picture(最小生成树)
- HDU 1162 Eddy's picture(图论-最小生成树)
- HDU-1162 Eddy's picture(最小生成树[Kruskal])
- HDU 1162 Eddy's picture(最小生成树-Prim)
- HDU 1162 Eddy's picture (最小生成树)
- hdu 1162 Eddy's picture(最小生成树,prim)
- HDU 1162 Eddy's picture (最小生成树)
- HDOJ 1162 Eddy's picture(最小生成树)
- 1162 Eddy's picture(最小生成树)
- 杭电ACM1162——Eddy's picture~~最小生成树
- javascript常用判断写法
- Eclipse中Android工程下布局文件无法正常预览
- 【技术支持】使用eclipse登陆oracle
- easypr车牌识别开源项目学习(二)
- 缓存淘汰算法--LRU算法
- 【杭电oj】1162 - Eddy's picture(最小生成树)
- Java并发编程:线程池的使用
- 一篇非常详细的 Docker 学习笔记
- Android studio 使用sharesdk详解
- IIS站点配置和DW CS6连接Access数据库
- 深入java虚拟机(四)
- chrome 下iframe编辑器换行
- net-snmp transport数据结构
- 缓存淘汰算法--LFU算法