poj1127线段求交

//题意：n根木棍，木棍i两端坐标为(pix,piy)和(qix,qiy)给定m对木棍(ai,bi)判断每对木棍是否相连
//通过相连木棍简介连在一起两跟木棍也是认为相连的
//其实就是判断两跟线段是否相交
//思路：定义内积 p1p2 = x1x2+ y1y2 外积 p1*p2 = x1y2 - x2y1
//通过外积判断是否在直线上，然后用点乘判断是否在线段上

#include <iostream>
using namespace std;

static double EPS = 1e-10;

static double add(double a,double b){
	if (abs(a+b)<EPS*(abs(a)+abs(b)))return 0;
	
	return a+b;
}

static struct P{
	double x,y;
	P(){

	}
	P(double x,double y):x(x),y(y){}
	P operator+(P p){
		return P(add(x,p.x),add(y,p.y));
	}
	P operator-(P p){
		return P(add(x,-p.x),add(y,-p.y));
	}
	P operator*(double d){
		return P(x*d,y*d);
	}
	double dot(P p){
		return add(x*p.x,y*p.y);
	}
	double det(P p){
		return add(x*p.y,-y*p.x);
	}
};


//判断点是否在线段p1-p2上
static bool on_seg(P p1,P p2,P q){
	return (p1 - q).det(p2-q) ==0&& (p1-q).dot(p2-q)<=0;
}


//计算直线p1-p2和直线q1-q2的交点
static P intersection(P p1,P p2,P q1,P q2){
	return p1 + (p2-p1)*((q2-q1).det(q1-p1)/(q2-q1).det(p2-p1));
}

#define  MAX_N  50
#define  MAX_M  10010
//输入
static int n;
static P p[MAX_N],q[MAX_N];
static int m;
static int a[MAX_M],b[MAX_M];
static bool g[MAX_N][MAX_N];//相连关系



static void solve(){
	for (int i=0;i<n;++i)
	{
		g[i][i] = true;
		for (int j=0;j<i;++j)
		{
			if ((p[i]-q[i]).det(p[j] - q[j])==0)//平行的时候
			{
				g[i][j] = g[j][i] = on_seg(p[i],q[i],p[j])
				                        || on_seg(p[i],q[i],q[j])
										||on_seg(p[j],q[j],p[i])
										||on_seg(p[j],q[j],q[i]);
			}
			else{
				P r = intersection(p[i],q[i],p[j],q[j]);
				g[i][j] = g[j][i] = on_seg(p[i],q[i],r)&&on_seg(p[j],q[j],r);
			}
		}
	}

	//通过floyd-warshall算法判断两点是否相同
	for (int k=0;k<n;++k)
	{
		for (int i=0;i<n;++i)
		{
			for (int j=0;j<n;++j)
			{
				g[i][j] |= g[i][k] &&g[k][j];
			}
		}
	}


	for (int i=0;i<m;++i)
	{
		puts(g[a[i] -1][b[i]-1]? "CONNECTED":"NOT CONNECTED");
	}

}


int main()
{

	while(scanf("%d",&n)&&n){
	
		memset(a,0,sizeof(a));
		memset(b,0,sizeof(b));
		memset(g,0,MAX_N*MAX_N);

		int p1x,p1y,q1x,q1y;
		for (int i=0;i<n;++i)
		{
			scanf("%d %d %d %d",&p1x,&p1y,&q1x,&q1y);
			p[i].x = p1x;p[i].y = p1y;
			q[i].x = q1x;q[i].y = q1y;
		}

		int a1,b1;
		int index = 0;
		while(scanf("%d %d",&a1,&b1))
		{
			if (a1==0&&b1==0)
			 break;
			a[index] = a1;
			b[index] = b1;
			index++;
		}
		m = index;

		solve();

	}

	return 0;
}