hdu-1162 Eddy's picture
来源:互联网 发布:asp会员积分系统源码 编辑:程序博客网 时间:2024/06/07 02:25
Eddy's picture
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8115 Accepted Submission(s): 4112
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
# include<math.h># include<stdio.h># include<string.h># include<algorithm># define INF 0x3f3f3f3f# define max 100 + 10using namespace std;int tree[max];int z, point;double a[max], b[max];double map[max][max],low[max];void prim(){for(int i = 1; i <= point; i++) low[i] = map[1][i];int next;memset(tree, 0, sizeof(tree));tree[1] = 1; double mindis = 0, min = 0;for(int i = 1; i < point; i++){min = INF;for(int j = 1; j <= point; j++){if(!tree[j] && low[j] < min){min = low[j];next = j;}}mindis = mindis + min;tree[next] = 1;for(int j = 1; j <= point; j++){if(!tree[j] && low[j] > map[next][j]) low[j] = map[next][j];}}printf("%.2lf\n",mindis);}int main(){while(scanf("%d",&z) != EOF){point = z;for(int i = 1; i <= z; i++)scanf("%lf%lf",&a[i],&b[i]);for(int i =1; i <= z; i++){for(int j = 1; j <= z; j++){map[i][j] = sqrt((a[i] - a[j]) * (a[i]-a[j]) + (b[i] - b[j]) * (b[i] - b[j]));}}prim(); }return 0;}
0 0
- Hdu-1162 Eddy's picture
- hdu 1162 Eddy's picture
- hdu 1162 Eddy's picture
- hdu 1162 Eddy's picture
- hdu 1162 Eddy's picture
- Hdu 1162 - Eddy's picture
- hdu 1162 Eddy's picture
- HDU 1162 Eddy's picture
- hdu 1162 Eddy's picture
- hdu 1162 Eddy's picture
- HDU 1162 Eddy's picture
- hdu-1162-Eddy's picture
- hdu 1162 Eddy's picture
- hdu 1162 Eddy's picture
- hdu 1162 Eddy's picture
- HDU 1162 Eddy's picture
- hdu 1162 Eddy's picture
- hdu 1162 Eddy's picture
- [IOS 开发] 防止button被点击多次
- HeadFirst 设计模式 3装饰者模式 (饮料问题)
- Win7Iso安装方法
- Failed to load the sqljdbc_auth.dll cause :- no sqljdbc_auth in java.library.path
- Android API Guides学习3——Activities
- hdu-1162 Eddy's picture
- LDR指令
- 布局的优化
- PHP 中$_SERVER 详细介绍
- 基于ArcGIS10.0和Oracle10g的空间数据管理平台(C#开发)-AE常用操作代码
- android stuio中assets文件夹在哪里?
- [图片]
- 关于iOS多线程
- 懒得笔记1 框架理念中一些 名词 解释