2018 ACM-ICPC, Asia Shenyang Regional L. Machining Disc Rotors

传送门

L. Machining Disc Rotors

题意： 给出一个大圆，然后再给出若干个小圆，这些小圆切割了大圆，求被切割后的几何图形的直径。

题解： 想法很简单，如果被切割后仍存在大圆直径，那么答案就是大圆直径，否则就是最远的两点距离。
对于如何判断是否存在直径可以枚举每个端点，然后求它关于原点的对称点，如果不在任何一个圆内，那么直径存在。
注意其他圆与大圆无交点时答案就是直径

#include<bits/stdc++.h>
using namespace std;
#define ll long long
//#define LL __int128;
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define PAUSE system("pause");
const double eps = 1e-8;
const int maxn = 2e2 + 10;
const int mod = 998244353;
int num;
int sgn(double x) {
	if(fabs(x) < eps) return 0;
	if(x < 0) return -1;
	else return 1;
}
struct Point{
	double x, y;
	Point(){}
	Point(double _x, double _y) {
		x = _x;
		y = _y;
	}
	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);
	}
	double distance(Point p) {
		return hypot(x - p.x, y - p.y);
	}
	double len() {
		return hypot(x, y);
	}
	Point trunc(double r) {
		double l = len();
		if(!sgn(l)) return *this;
		r /= l;
		return Point(x * r, y * r);
	}
	Point rotleft() {
		return Point(-y, x);
	}
	Point rotright() {
		return Point(y, -x);
	}
}P[maxn];
struct circle{
	Point p;
	double r;
	circle(){}
	circle(Point _p, double _r) {
		p = _p;
		r = _r;
	}
	int relation(Point b) {
		double dst = b.distance(p);
		if(sgn(dst - r) < 0) return 2;
		else if(sgn(dst - r) == 0) return 1;
		return 0;
	}
	int relationcircle(circle v) {
		double d = p.distance(v.p);
		if(sgn(d - r - v.r) > 0) return 5;
		if(sgn(d - r - v.r) == 0) return 4;
		double l = fabs(r - v.r);
		if(sgn(d - r - v.r) < 0 && sgn(d - l) > 0) return 3;
		if(sgn(d - l) == 0) return 2;
		if(sgn(d - l) < 0) return 1;
	}
	void pointcrosscircle(circle v) {
		int rel = relationcircle(v);
		if(rel == 1 || rel == 5) return ;
		double d = p.distance(v.p);
		double l = (d * d + r * r - v.r * v.r) / (2 * d);
		double h = sqrt(r * r - l * l);
		Point tmp = p + (v.p - p).trunc(l);
		if(rel == 2 || rel == 4) return ;
		P[++num] = tmp + ((v.p - p).rotleft().trunc(h));
		P[++num] = tmp + ((v.p - p).rotright().trunc(h));
	}
}C, c[maxn];
int n, cas;
void solve() {
	scanf("%d %lf", &n, &C.r);
	C = circle(Point(0, 0), C.r);
	num = 0;
	for(int i = 1; i <= n; i++) {
		double x, y;
		scanf("%lf %lf %lf", &x, &y, &c[i].r);
		c[i] = circle(Point(x, y), c[i].r);
		C.pointcrosscircle(c[i]);
	}
	printf("Case #%d: ", ++cas);
	// for(int i = 1; i <= num; i++) 
	// 	printf("*%lf %lf\n", P[i].x, P[i].y);
	if(num == 0) {
		printf("%.15f\n", C.r * 2.0);
		return ;
	}
	int flag = 0;
	double ans = 0;
	for(int i = 1; i <= num; i++) {
		flag = 0;
		Point pos = Point(-P[i].x, -P[i].y);
		for(int j = 1; j <= n; j++) {
			if(c[j].relation(pos) == 2) {
				flag = 1;
				break;
			}
		}
		if(flag == 0) {
			printf("%.15f\n", C.r * 2.0);
			return ;
		}
	}
	for(int i = 1; i < num; i++) {
		for(int j = i + 1; j <= num; j++) {
			ans = max(ans, P[i].distance(P[j]));
		}
	}
	printf("%.15f\n", ans);
}
int main() {
	int t = 1;
	scanf("%d", &t);
	// cin>>t;
	while(t--)
		solve();
	return 0;
}