hdoj 1162 Eddy's picture【最小生成树】
来源:互联网 发布:pickit3烧写软件 编辑:程序博客网 时间:2024/05/01 07:39
Eddy's picture
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8117 Accepted Submission(s): 4114
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代码:Kruskal算法:#include<stdio.h>#include<algorithm>#include<math.h>using namespace std;int n;double x[110],y[110];int per[110];struct record{int s,e;double w;}num[10000];bool cmp(record a,record b){return a.w<b.w;}int init(){for(int i=1;i<=n;i++){per[i]=i;}}int find(int x){int r;r=x;while(r!=per[r]){r=per[r];}per[x]=r;return r;}int join(int x,int y){int fx=find(x);int fy=find(y);if(fx!=fy){per[fx]=fy;return true;}return false;}int main(){int i,j,k;double d,sum;while(scanf("%d",&n)!=EOF){k=0;sum=0;init();for(i=1;i<=n;i++){scanf("%lf%lf",&x[i],&y[i]);}for(i=1;i<=n;i++){for(j=i+1;j<=n;j++){d=sqrt((x[j]-x[i])*(x[j]-x[i])+(y[j]-y[i])*(y[j]-y[i])); num[k].s=i; num[k].e=j; num[k].w=d; k++;}}sort(num,num+k,cmp);for(i=0;i<k;i++){if(join(num[i].s,num[i].e)){sum+=num[i].w;}}printf("%.2lf\n",sum);}return 0;}Prim算法:#include<stdio.h>#include<string.h>#include<math.h>#define INF 0x3f3f3fint vis[110];double x[110],y[110],low[110],map[110][110];int n;int prim(){int i,j,next;double min,sum=0;memset(vis,0,sizeof(vis));for(i=1;i<=n;i++){low[i]=map[1][i];}vis[1]=1;for(i=2;i<=n;i++){min=INF;for(j=1;j<=n;j++){if(!vis[j]&&min>low[j]){min=low[j];next=j;}}sum+=min;vis[next]=1;for(j=1;j<=n;j++){if(!vis[j]&&low[j]>map[next][j]){low[j]=map[next][j];}}}printf("%.2lf\n",sum);}int main(){int i,j;double d;while(scanf("%d",&n)!=EOF){for(i=1;i<=n;i++){for(j=1;j<=n;j++){if(i==j)map[i][j]=map[j][i]=0;elsemap[i][j]=map[j][i]=INF;}}for(i=1;i<=n;i++){scanf("%lf%lf",&x[i],&y[i]);}for(i=1;i<=n;i++){for(j=i+1;j<=n;j++){d=sqrt((x[j]-x[i])*(x[j]-x[i])+(y[j]-y[i])*(y[j]-y[i]));map[i][j]=map[j][i]=d;}}prim();}return 0;}
0 0
- HDOJ 1162:Eddy's picture 求解最小生成树
- HDOJ 1162 Eddy's picture(最小生成树 - kruskal)
- HDOJ 题目1162 Eddy's picture(最小生成树)
- hdoj 1162 Eddy's picture 【最小生成树】
- hdoj 1162 Eddy's picture(最小生成树)
- HDOJ 1162 Eddy's picture(最小生成树--kruskal)
- HDOJ 1162 Eddy's picture(最小生成树prim算法)
- hdoj 1162 Eddy's picture【最小生成树】
- HDOJ 1162 Eddy's picture 最小生成树 Kruscal && Prim
- HDOJ 1162 Eddy's Picture (最小生成树)
- hdoj--1162--Eddy's picture(最小生成树)
- hdoj 1162 Eddy's picture【最小生成树 kruskal && prim】
- HDOJ 1162 Eddy's picture(最小生成树)
- HDOJ 1162 Eddy's picture 最小生成树
- HDOJ 1198 Eddy's picture 最小生成树
- Eddy's picture(最小生成树)
- HDU1162 Eddy's picture 最小生成树
- hdu 1162 Eddy's picture(最小生成树Prim算法)
- 珠海代办医院诊断书
- 九度 Online Judge 算法 刷题 题目1045:百鸡问题
- 长春代办医院诊断书
- RecycleView
- 武汉代办医院诊断书
- hdoj 1162 Eddy's picture【最小生成树】
- 南京代办医院诊断书
- 太原代办医院诊断书
- hevc代码阅读框架
- C++ 对象动态建立与释放
- 大连代办医院诊断书
- 邯郸代办医院诊断书
- HDUOJ_1102(Constructing Roads)(最小生成树)
- 承德代办医院诊断书