题目链接:https://cn.vjudge.net/problem/POJ-2031
就是n个点之间的最短距离,跑最小生成树,WA了七发,在于输出
1.G++ 的double类型printf输出用%f,而C++都用%lf(找了半天原因)
求出球心距离,然后减去半径和,小于0就dis为0。
#include<queue>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<cmath>
using namespace std;
#define ll long long
#define up(i,a,n) for(int i=a;i<=n;i++)
#define pb push_back
const int inf=0x3f3f3f3f;
const int maxn=1e4+10;
bool vis[maxn];
int n,m,tot,ans,cnt;
struct node
{
int to;
double cap;
friend bool operator < (node a,node b)
{
return a.cap>b.cap;
}
};
struct node1
{
double x,y,z,r;
}arr[maxn];
vector<node>g[maxn];
void add(int x,int y,double z)
{
g[x].pb(node{y,z});
g[y].pb(node{x,z});
}
double dis(node1 a,node1 b)
{
double ans=sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)+(a.z-b.z)*(a.z-b.z))-a.r-b.r;
return ans<0?0:ans;
}
int init()
{
up(i,1,n)
scanf("%lf %lf %lf %lf",&arr[i].x,&arr[i].y,&arr[i].z,&arr[i].r);
up(i,1,n)
up(j,i+1,n)
add(i,j,dis(arr[i],arr[j]));
}
double prim()
{ double sum=0;
memset(vis,false,sizeof(vis));
priority_queue<node>q;
q.push(node{1,0});
while(!q.empty())
{
node s=q.top();q.pop();
if(vis[s.to])continue;
vis[s.to]=true;
sum+=s.cap;
for(int i=0;i<g[s.to].size();i++)
{
if(!vis[g[s.to][i].to])
q.push(g[s.to][i]);
}
}
return sum;
}
int main()
{
while(~scanf("%d",&n))
{
if(n<=0)break;
up(i,0,1000)
{
arr[i].x=0;
arr[i].y=0;
arr[i].z=0;
arr[i].r=0;
}
for(int i=0;i<=maxn;i++)
{
g[i].clear();
}
init();
printf("%.3f\n",prim());
}
return 0;
}