牛客国庆集训派对Day1 L题

派对Day1 L题"/>

牛客国庆集训派对Day1 L题

题目链接：

今天在牛客网上过国庆节的时候发现一个有点意思的最短路问题，链接在上面，代码在下面：

#include<bits/stdc++.h>
using namespace std;
int a,b,c1,c2;
const int INF =1e8; 
struct node{int x,y,r;
}cir[1005];
int book[1005];
double distance1(node A,node B){double dis=sqrt(pow(A.x-B.x,2)+pow(A.y-B.y,2));return max(dis-A.r-B.r,0.0);
}
double distance2(node A,int c){double dis=abs(a*A.x+b*A.y+c)/sqrt(pow(a,2)+pow(b,2));return max(dis-A.r,0.0);
}
double dis[1005];
int main()
{int n;cin>>n>>a>>b>>c1>>c2;memset(dis,1e5,sizeof(dis));memset(book,0,sizeof(book));for(int i=0;i<n;i++){scanf("%d%d%d",&cir[i].x,&cir[i].y,&cir[i].r);}for(int i=0;i<n;i++){dis[i]=distance2(cir[i],c1);}dis[n]=abs(c1-c2)/sqrt(pow(a,2)+p