hdoj_1162Eddy's picture(最小生成树)
来源:互联网 发布:为什么选择java 编辑:程序博客网 时间:2024/06/03 22:05
Eddy's picture
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4953 Accepted Submission(s): 2448
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 <algorithm>#include <cstdio>#include <cmath>using namespace std;#pragma warning(disable : 4996)#define MAX 10000typedef struct edge{int x, y;double w;}edge;edge e[MAX];int father[MAX], ranks[MAX];bool cmp(edge a,edge b){return a.w < b.w;}void Make_Set(int n){for(int i = 1; i <= n; i++){father[i] = i;ranks[i] = 0;}}int Find_Set(int x){if(x != father[x])father[x] = Find_Set(father[x]);return father[x];}void Merge_Set(int x, int y){x = Find_Set(x);y = Find_Set(y);if(x == y) return;if(ranks[x] > ranks[y]){father[y] = x;}else if(ranks[x] < ranks[y]){father[x] = y;}else {ranks[y]++;father[x] = y;}}int main(){freopen("in.txt", "r", stdin);double point[MAX][2] = {0.0};int n, count;double len;while (scanf("%d", &n) != EOF){count = 0;for(int i = 1; i <= n; i++){scanf("%lf %lf", &point[i][0], &point[i][1]);}for(int i = 1; i <= n; i++){for(int j = i + 1; j <= n; j++){len = sqrt((point[i][0] - point[j][0]) * (point[i][0] - point[j][0]) + (point[i][1] - point[j][1]) * (point[i][1] - point[j][1]));if(len > 0){e[count].x = i;e[count].y = j;e[count++].w = len;}}}Make_Set(count - 1);sort(e, e + count , cmp);/*for(int i = 0; i < count; i++){cout << e[i].x << " " << e[i].y << " " << e[i].w << endl;}*/double sum = 0.0;for (int i = 0; i < count; i++){int x = Find_Set(e[i].x);int y = Find_Set(e[i].y);if(x != y){Merge_Set(e[i].x, e[i].y);sum += e[i].w;}}printf("%.2lf\n", sum);}return 0;}
- hdoj_1162Eddy's picture(最小生成树)
- Eddy's picture(最小生成树)
- HDOJ 1162 Eddy's picture(最小生成树 - kruskal)
- hdu 1162 Eddy's picture(最小生成树)
- hdu 1162 Eddy's picture(基础最小生成树)
- HDOJ 题目1162 Eddy's picture(最小生成树)
- Eddy's picture(并查集+最小生成树)
- HDU 1162 Eddy's picture(图论-最小生成树)
- 杭电1162Eddy'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(最小生成树)
- HDU1162 Eddy's picture 最小生成树
- hdu1162Eddy's picture 最小生成树
- Routes-openstack-python
- 人脸识别图像库
- 键盘事件导致view上移下移
- linux 设置ip地址信息
- MYSQL安装到最后一步服务器失败的操作
- hdoj_1162Eddy's picture(最小生成树)
- VS2010 Express 使用小知识
- Weka开发[19]——NaiveBayes源代码分析
- jQuery,javascript获得网页的高度和宽度 .
- 使用Xmanager在CentOs5.5 安装oracle11g r2
- c文件与h文件及包含关系
- 线程编程中用到HttpContext.Current的方法封装
- C/C++堆、栈及静态数据区详解
- SWIFT API 使用文档