hdu4773 Problem of Apollonius

http://acm.hdu.edu.cn/showproblem.php?pid=4773

2017ccpc网络赛的时候，我跟szh因为精度不够没过的那道几何题，后来听GB说是要圆的反演，可以提高精度，甚至可以把圆变成线来做。然而我19年学几何的时候忘记了这个知识点，结果19沈阳就出现了，拿坐标公式在那里硬搞。。

今天终于想起来了，代码和思路均来自https://www.cnblogs.com/NineSwords/p/9225187.html

写的非常好，我突然发现我甚至没写过两个圆的公切线怎么求。。。于是还是抄了他的代码，"学会思想自己实现"大失败，感觉之前拿上交小红书学的几何还是远远不够，之后再去看看白书，多补点题之类的。。。

#include<bits/stdc++.h>
using namespace std;

const double eps=1e-7;

inline int sgn(double x)
{
	if(x>-eps && x<eps) return 0;
	if(x>0) return 1;
	else	return -1;
}

struct point
{
	double x,y;
	point(double a=0,double b=0)
	{
		x=a;y=b;
	}
	point operator + (const point b)const
	{
		return point(x+b.x,y+b.y);
	}
	point operator - (const point b)const
	{
		return point(x-b.x,y-b.y);
	}
	point operator * (const double t)const
	{
		return point(x*t,y*t);
	}
};
struct circle
{
	point o;
	double r;	
};
inline double sqr(double x)
{
	return x*x;
}
inline double det(point a,point b)
{
	return a.x*b.y-a.y*b.x;
}
inline double dist(point a,point b)
{
	return sqrt(sqr(a.x-b.x)+sqr(a.y-b.y));
}
point moveit(point a,double b,double len)
{
	return point(a.x+len*cos(b),a.y+len*sin(b));
}

circle a,b,ans[3];
point p;
int tot;

inline void prework()
{
	scanf("%lf%lf%lf",&a.o.x,&a.o.y,&a.r);
	scanf("%lf%lf%lf",&b.o.x,&b.o.y,&b.r);
	scanf("%lf%lf",&p.x,&p.y);
}

inline circle inversion(circle a,point p,double R)
{
	circle res;
	double d1=dist(p,a.o);
	res.r=a.r*R*R/(sqr(d1)-sqr(a.r));
	double d2=R*R/(d1-a.r)-res.r;
	res.o=p+(a.o-p)*(d2/d1);
	return res;
}

inline void addans(point t1,point t2)
{
	++tot;
	double d=fabs(det(t1-p,t2-p))/dist(t1,t2);
	ans[tot].r=sqr(20)/d/2;
	ans[tot].o=p+(t1-a.o)*(ans[tot].r/a.r);
}

inline void mainwork()
{
	tot=0;
	a=inversion(a,p,20);b=inversion(b,p,20);
	if(a.r<b.r)
		swap(a,b);
	point c=b.o-a.o;
	double a1=atan2(c.y,c.x);
	double a2=acos((a.r-b.r)/dist(a.o,b.o));
	point t1=moveit(a.o,a1+a2,a.r);
	point t2=moveit(b.o,a1+a2,b.r);
	if(sgn(det(t2-t1,a.o-t1))==sgn(det(t2-t1,p-t1)))
		addans(t1,t2);
	t1=moveit(a.o,a1-a2,a.r);
	t2=moveit(b.o,a1-a2,b.r);
	if(sgn(det(t2-t1,a.o-t1))==sgn(det(t2-t1,p-t1)))
		addans(t1,t2);
}

inline void print()
{
	printf("%d\n",tot);
	for(int i=1;i<=tot;i++)
		printf("%.8f %.8f %.8f\n",ans[i].o.x,ans[i].o.y,ans[i].r);
}

int main()
{
	int t;
	scanf("%d",&t);
	for(int i=1;i<=t;i++)
	{
		prework();
		mainwork();
		print();
	}
	return 0;
}