Poj 1127:Jack Straws--空间线段相交+并查集

题目链接

思路

最后一句话，间接相连的两根木棍也是相连的，因此可以使用并查集来计算并查集基础，将所有连接起来的木棍放在一个集合里。那么现在的难点在于如何判断平面上两个直线相交 判定方法，解决了这两个问题，我们只需要依次输入线段两端点的信息，然后将其与其他的线段进行比较，如果相连，对集合进行合并即可。

#include<iostream>
#include<cmath>
#include<iomanip>
#include<vector>
#include<map>
#include<queue>
#include<algorithm>
#include<string.h>
using namespace std;

#define ll int
#define Max 15

ll n, kind[Max];
struct line {
	double x1, y1, x2, y2;
	line(double a = 0, double b = 0, double c = 0, double d = 0) { x1 = a, y1 = b, x2 = c, y2 = d; }
}lines[Max];

//是否相交
bool intersection(line & l1, line & l2) {
	//快速排斥
	if ((l1.x1 > l1.x2 ? l1.x1 : l1.x2) < (l2.x1 < l2.x2 ? l2.x1 : l2.x2) ||//l1右端点小于l2左端点
		(l2.x1 > l2.x2 ? l2.x1 : l2.x2) < (l1.x1 < l1.x2 ? l1.x1 : l1.x2) ||//l2右端点小于l1左端点
		(l1.y1 > l1.y2 ? l1.y1 : l1.y2) < (l2.y1 < l2.y2 ? l2.y1 : l2.y2) ||//l1上端点小于l2下端点
		(l2.y1 > l2.y2 ? l2.y1 : l2.y2) < (l1.y1 < l1.y2 ? l1.y1 : l1.y2))	//l2上端点小于l1下端点
		return false;
	//跨立实验 叉乘：x1y2-x2y1 等于0说明有个端点在另一条线上
	if ((((l1.x1 - l2.x1)*(l2.y2 - l2.y1) - (l1.y1 - l2.y1)*(l2.x2 - l2.x1))*
		((l1.x2 - l2.x1)*(l2.y2 - l2.y1) - (l1.y2 - l2.y1)*(l2.x2 - l2.x1))) > 0 ||
		(((l2.x1 - l1.x1)*(l1.y2 - l1.y1) - (l2.y1 - l1.y1)*(l1.x2 - l1.x1))*
		((l2.x2 - l1.x1)*(l1.y2 - l1.y1) - (l2.y2 - l1.y1)*(l1.x2 - l1.x1))) > 0)
	{
		return false;
	}
	return true;
}

ll find(ll x) {
	if (x == kind[x]) return x;
	else return kind[x] = find(kind[x]);
}

void unite(ll a, ll b) {
	kind[find(b)] = kind[find(a)];
}

int main() {
	while (cin >> n) {
		if (n == 0)break;
		for (ll i = 0; i < n; i++) kind[i] = i;
		for (ll i = 0; i < n; i++) {
			cin >> lines[i].x1 >> lines[i].y1 >> lines[i].x2 >> lines[i].y2;
			for (ll j = i - 1; j >= 0; j--) {
				if (intersection(lines[j], lines[i])) {
					unite(j, i);
				}
			}
		}
		ll a, b;
		while (cin >> a >> b) {
			if (a + b == 0) break;
			if (find(a - 1) == find(b - 1)) cout << "CONNECTED" << endl;
			else cout << "NOT CONNECTED" << endl;
		}
	}
}