(hdu step 6.1.2)Eddy's picture(在只给出二维坐标点的情况下,求让n个点连通的最小费用)
2015-03-09 20:42
295 查看
题目:
题目分析:
使用kruscal来求最小生成树,简单题。这道题和上一道题比较的特点就在于:
1)有一维坐标点变成二维坐标点。
struct Point{
double x;
double y;
}points[maxn];
2)点与点之间的距离不再直接给出,而需要你自己算。
edges[cnt++].weight = get_distance(points[i],points[j]);//这是点与点之间的距离不再是直接给出而是需要你自己算
代码如下:
/*
* b.cpp
*
* Created on: 2015年3月9日
* Author: Administrator
*/
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const int maxn = 101;
struct Point{
double x;
double y;
}points[maxn];
struct Edge{
int begin;
int end;
double weight;
}edges[maxn*maxn];
int father[maxn];
int find(int a){
if(a == father[a]){
return a;
}
return father[a] = find(father[a]);
}
double kruscal(int count){
int i;
for(i = 1 ; i < maxn ; ++i){
father[i] = i;
}
double sum = 0;
for(i = 1 ; i <= count ; ++i){
int fx = find(edges[i].begin);
int fy = find(edges[i].end);
if(fx != fy){
father[fx] = fy;
sum += edges[i].weight;
}
}
return sum;
}
double get_distance(Point a,Point b){
return sqrt(pow(b.x-a.x,2)+pow(b.y-a.y,2));
}
bool cmp(Edge a,Edge b){
return a.weight < b.weight;
}
int main(){
int n;
while(scanf("%d",&n)!=EOF){
int i;
for(i = 1 ; i <= n ; ++i){
scanf("%lf%lf",&points[i].x,&points[i].y);
}
int cnt = 1;
int j;
for(i = 1 ; i <= n ; ++i){//枚举所有能形成边的情况
for(j = i+1 ; j <= n ; ++j){
edges[cnt].begin = i;
edges[cnt].end = j;
edges[cnt++].weight = get_distance(points[i],points[j]);//这是点与点之间的距离不再是直接给出而是需要你自己算
}
}
cnt -= 1;
sort(edges+1,edges+1+cnt,cmp);
printf("%.2lf\n",kruscal(cnt));
}
return 0;
}
Eddy's picture |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
Total Submission(s): 172 Accepted Submission(s): 126 |
[align=left]Problem Description[/align]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? |
[align=left]Input[/align]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. |
[align=left]Output[/align]Your program prints a single real number to two decimal places: the minimum total length of ink lines that can connect all the points. |
[align=left]Sample Input[/align]3 1.0 1.0 2.0 2.0 2.0 4.0 |
[align=left]Sample Output[/align]3.41 |
[align=left]Author[/align]eddy |
[align=left]Recommend[/align]JGShining |
使用kruscal来求最小生成树,简单题。这道题和上一道题比较的特点就在于:
1)有一维坐标点变成二维坐标点。
struct Point{
double x;
double y;
}points[maxn];
2)点与点之间的距离不再直接给出,而需要你自己算。
edges[cnt++].weight = get_distance(points[i],points[j]);//这是点与点之间的距离不再是直接给出而是需要你自己算
代码如下:
/*
* b.cpp
*
* Created on: 2015年3月9日
* Author: Administrator
*/
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const int maxn = 101;
struct Point{
double x;
double y;
}points[maxn];
struct Edge{
int begin;
int end;
double weight;
}edges[maxn*maxn];
int father[maxn];
int find(int a){
if(a == father[a]){
return a;
}
return father[a] = find(father[a]);
}
double kruscal(int count){
int i;
for(i = 1 ; i < maxn ; ++i){
father[i] = i;
}
double sum = 0;
for(i = 1 ; i <= count ; ++i){
int fx = find(edges[i].begin);
int fy = find(edges[i].end);
if(fx != fy){
father[fx] = fy;
sum += edges[i].weight;
}
}
return sum;
}
double get_distance(Point a,Point b){
return sqrt(pow(b.x-a.x,2)+pow(b.y-a.y,2));
}
bool cmp(Edge a,Edge b){
return a.weight < b.weight;
}
int main(){
int n;
while(scanf("%d",&n)!=EOF){
int i;
for(i = 1 ; i <= n ; ++i){
scanf("%lf%lf",&points[i].x,&points[i].y);
}
int cnt = 1;
int j;
for(i = 1 ; i <= n ; ++i){//枚举所有能形成边的情况
for(j = i+1 ; j <= n ; ++j){
edges[cnt].begin = i;
edges[cnt].end = j;
edges[cnt++].weight = get_distance(points[i],points[j]);//这是点与点之间的距离不再是直接给出而是需要你自己算
}
}
cnt -= 1;
sort(edges+1,edges+1+cnt,cmp);
printf("%.2lf\n",kruscal(cnt));
}
return 0;
}
相关文章推荐
- (hdu step 6.1.6)Jungle Roads(在索引为字符索引的情况下,求让n个点连通的最小费用)
- (hdu step 6.1.7)Connect the Cities(在有的路已经修建好的情况下,求让n个点连通的最小费用)
- HDU 1162 Eddy's picture(点连通:最小生成树)
- (step 6.1.9)hdu 1162(Eddy's picture——最小生成树)
- (hdu step 6.1.5)继续畅通工程(求让n个点连通的最小费用)
- HDU 1162 Eddy's picture 最小生成树
- (hdu step 4.2.4)A strange lift(求从起点到终点的最小步数,限制条件是:在一维的情况下)
- HDU 3072--Intelligence System【SCC缩点新构图 && 求连通全部SCC的最小费用】
- (hdu step 6.1.4)还是畅通工程(求让n个点联通的最小费用)
- hdu 3627 Giant For 离散化+线段树 在一个二维平面内任意的添加一个点和删除一个点,然后来寻找一个横纵坐标都比已经添加的点大的点,首先选择横坐标最小的,其次是纵坐标最小的
- HDU1162-Eddy's picture-最小生成树(prim算法模板)
- HDU 1162 Eddy's picture 最小生成树
- 最小生成树(模板题)Eddy's picture HDU - 1162
- HDU 3072--Intelligence System【SCC缩点新构图 && 求连通所有SCC的最小费用】
- (heu step 6.1.1)Constructing Roads(最小生成树模板题:求让n个点连通的最小费用)
- hdu 2295 Radar 重复覆盖 DLX+二分答案 给出一些城市及一些雷达的坐标,要求从这些雷达中选取最多k个能够覆盖所有的城市,问雷达的最小覆盖半径为多少
- (step6.1.2)hdu 1863(畅通工程——最小生成树)
- HDU 1162 Eddy's picture【最小生成树,Prime算法+Kruskal算法】
- hdu 2159 二维费用背包问题
- hdu2159之FATE--二维费用背包