Eddy's picture
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8122 Accepted Submission(s): 4118
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
3 1.0 1.0 2.0 2.0 2.0 4.0
Sample Output
3.41
最小生成树,模板 Kruscal 或 Prim
已AC代码:(Kruscal )
#include<cstdio>
#include<cstring>
#include<cmath>
#define M 25000
#include<algorithm>
using namespace std;
int per[300]; // 并查集
double x[300],y[300];
int n,m;
struct node{
int u,v;
double w; //w为距离
}s[M];
bool cmp(node a,node b)
{
return a.w<b.w;
}
double dlen(int i,int j)
{
return sqrt( (x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]) );
}
void into() //初始化
{
for(int i=0;i<=n;++i)
per[i]=i;
}
int find(int x) // 查找根节点
{
return x == per[x] ? x : per[x] = find(per[x]);
}
bool join(int a,int b) //合并根节点,并判断是否成环
{
int fa=find(a);
int fb=find(b);
if(fa!=fb)
{
per[fa]=fb;
return true;
}
return false;
}
int main()
{
int i,j,cas=0;
while(scanf("%d",&n)!=EOF)
{
for(i=1;i<=n;++i)
scanf("%lf%lf",&x[i],&y[i]);
int k=0;
for(i=1;i<n;++i) //读入数据
{
for(j=i+1;j<=n;++j)
{
s[k].u=i;
s[k].v=j;
s[k].w=dlen(i,j);
k++;
}
}
into(); //初始化根节点
sort(s,s+k,cmp); //按距离从小到大排序
double sum=0;
for(i=0;i<k;++i)
{
if(join(s[i].u,s[i].v))
{
sum+=s[i].w;
}
}
printf("%.2lf\n",sum);
}
return 0;
}
已AC代码:( Prim)
#include<cstdio>
#include<cstring>
#include<cmath>
#define INF 0xfffffff
double x[300],y[300],sum; //最小生成树权值和
int n,m;
int vis[300]; //map二维数组存图,low记录每2个点间最小权值,vis标记某点是否已访问
double map[300][300],low[300];
double dlen(int i,int j)
{
return sqrt( (x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]) );
}
void prim()
{
memset(vis,0,sizeof(vis));
int i,j,pos,t;
double MIN;
for(i=1;i<=n;++i) //从某点开始,分别标记vis和记录该点pos
low[i]=map[1][i]; //第一次给low数组赋值 map的第一行
vis[1]=1;pos=1;t=0;
for(i=1;i<n;++i) //再运行n-1次,一次找一个最小
{
MIN=INF;
for(j=1;j<=n;++j)
{
if(vis[j]==0&&low[j]<MIN)
{
MIN=low[j]; // 找出最小值min,记录位置pos
pos=j;
}
}
sum+=MIN;
vis[pos]=1; //标记该点已访问
for(j=1;j<=n;++j) //更新权值low 把 map的 pos 行中比对应的 low 小的赋给low
if(vis[j]==0&&low[j]>map[pos][j])
low[j]=map[pos][j];
}
}
int main()
{
int i,j;
while(scanf("%d",&n)!=EOF)
{
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)
{
map[i][j]=map[j][i]=dlen(i,j);
}
}
sum=0;
prim();
printf("%.2lf\n",sum);
}
return 0;
}