【2019 Multi-University Training Contest 1】【HDU6590 Code】【凸包相交模板】

题目链接：
http://acm.hdu.edu.cn/showproblem.php?pid=6590
题意：
给你一组数据， D = { ( x 1 , y 1 ) , ( x 2 , y 2 ) , ⋅ ⋅ ⋅ , ( x n , y n ) } D = \left \{ (x_1,y_1), (x_2,y_2), ···, (x_n,y_n) \right \} D={(x1​,y1​),(x2​,y2​),⋅⋅⋅,(xn​,yn​)}其中$x_i$是一个$d$维向量，简单起见题目取$d=2$，并且 y i ∈ { 1 , − 1 } y_i ∈ \left \{1,-1\right\} yi​∈{1,−1}，现在问是否存在一个$d$维向量$w$使得，$f(x_i)=sign({\sum }_{i=0}^d{w}_i{x}_i+b)=sign(w^T{x}_i)$，其中$w_0=b,x_0=1$增加向量一维，$sign(x)$为符号函数，0就是0，大于0就是1，小于0就是-1。
题解：
如果$d=1$，那么这里很简单，就是给你一组点$(x_i,y_i)$要你拟合一条直线，在$xy$平面内找到一条直线使得所有$y=1$的点都在直线上方，所有$y=-1$的点都在直线下方。
同理，在$d=2$的情况下，实际上就是在$x_1{x}_{2}y$的三维平面内，拟合一个平面，使得所有$y=1$的点都在平面上方，$y=-1$的点在平面下方，因为所有的点$(x_{i,1},x_{i,2})$都在一个平面内，实际上也就是在$x_1{x}_2$平面内找到一条直线将两个集合中的点分成两部分，以样例三为例：

这里就是不管怎么样都不能用一条线将白点和黑点分到两边，所以输出Infinite loop!
代码：

#include <bits/stdc++.h>
using namespace std;
double eps = 1e-15;
double pi = acos(-1);
struct Point {
	double x, y;
	Point(double x = 0, double y = 0) :x(x), y(y) {}
};
typedef Point Vector;
Vector operator + (Vector A, Vector B) { return Vector(A.x + B.x, A.y + B.y); }
Vector operator - (Vector A, Vector B) { return Vector(A.x - B.x, A.y - B.y); }
Vector operator * (Vector A, double B) { return Vector(A.x * B, A.y * B); }
Vector operator / (Vector A, double B) { return Vector(A.x / B, A.y / B); }
int dcmp(double x) {
	if (fabs(x) < eps)return 0;
	else return x < 0 ? -1 : 1;
}
bool operator < (const Point& a, const Point& b) {
	return dcmp(a.x - b.x) < 0 || (dcmp(a.x - b.x) == 0 && dcmp(a.y - b.y) < 0);
}
bool operator == (const Point& a, const Point& b) {
	return dcmp(a.x - b.x) == 0 && dcmp(a.y - b.y) == 0;
}
double Cross(Vector A, Vector B) {
	return A.x * B.y - A.y * B.x;
}
double Dot(Vector A, Vector B) {
	return A.x * B.x + A.y * B.y;
}
Vector Rotate(Vector A, double rad) {
	return Vector(A.x * cos(rad) - A.y * sin(rad), A.x * sin(rad) + A.y * cos(rad));
}
int tubao(Point* p, int n, Point* ch) {
	sort(p, p + n);
	//n=unique(p,p+n)-p;
	int m = 0;
	for (int i = 0; i < n; i++) {
		while (m > 1 && Cross(ch[m - 1] - ch[m - 2], p[i] - ch[m - 2]) <= 0)m--;
		ch[m++] = p[i];
	}
	int k = m;
	for (int i = n - 2; i >= 0; i--) {
		while (m > k && Cross(ch[m - 1] - ch[m - 2], p[i] - ch[m - 2]) <= 0)m--;
		ch[m++] = p[i];
	}
	if (n > 1)m--;
	return m;
}
bool onsegment(Point p, Point a1, Point a2) {
	if (p == a1 || p == a2)return false;
	return dcmp(Cross(a1 - p, a2 - p)) == 0 && dcmp(Dot(a1 - p, a2 - p)) < 0;
}
bool segmentcross(Point a1, Point a2, Point b1, Point b2) {
	if (a1 == b1 || a1 == b2 || a2 == b1 || a2 == b2)return true;
	double c1 = Cross(a2 - a1, b1 - a1), c2 = Cross(a2 - a1, b2 - a1),
		c3 = Cross(b2 - b1, a1 - b1), c4 = Cross(b2 - b1, a2 - b1);
	return dcmp(c1) * dcmp(c2) < 0 && dcmp(c3) * dcmp(c4) < 0;
}
int intubao(Point* ch, int n, Point p) {
	Vector A, B;
	int flag = 0;
	for (int i = 0; i < n; i++) {
		A = ch[(i + 1) % n] - ch[i];
		B = p - ch[i];
		if (onsegment(p, ch[i], ch[(i + 1) % n])) {
			flag = -1;
			break;
		}
		else if (Cross(A, B) > 0) {
			flag++;
		}
	}
	if (flag == -1 || flag == n)return 1;
	return 0;
}
int T, n, m;
Point p1[10005], ch1[10005], p2[10005], ch2[10005];
int main() {
	scanf("%d", &T);
	while (T--) {
		int N;
		m = n = 0;
		scanf("%d", &N);
		for (int i = 1; i <= N; i++) {
			double x, y;
			int z;
			scanf("%lf%lf%d", &x, &y, &z);
			if (z == 1) {
				p1[n].x = x;
				p1[n].y = y;
				n++;
			}
			else {
				p2[m].x = x;
				p2[m].y = y;
				m++;
			}
		}
		int m1 = tubao(p1, n, ch1);
		int m2 = tubao(p2, m, ch2);
		int flag = 0;
		for (int i = 0; i < m1; i++) {
			for (int j = 0; j < m2; j++) {
				if (segmentcross(ch1[i], ch1[(i + 1) % m1], ch2[j], ch2[(j + 1) % m2])) {
					flag = 1;
					break;
				}
			}
		}
		for (int i = 0; i < m1; i++) {
			if (intubao(ch2, m2, ch1[i])) {
				flag = 1;
				break;
			}
		}
		for (int i = 0; i < m2; i++) {
			if (intubao(ch1, m1, ch2[i])) {
				flag = 1;
				break;
			}
		}
		if (flag)printf("Infinite loop!\n");
		else printf("Successful!\n");
	}
	return 0;
}