POJ1127——Jack Straws（计算几何，直线相交）

Jack Straws

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 4059		Accepted: 1836

Description

In the game of Jack Straws, a number of plastic or wooden "straws" are dumped on the table and players try to remove them one-by-one without disturbing the other straws. Here, we are only concerned with if various pairs of straws are connected by a path of touching straws. You will be given a list of the endpoints for some straws (as if they were dumped on a large piece of graph paper) and then will be asked if various pairs of straws are connected. Note that touching is connecting, but also two straws can be connected indirectly via other connected straws.

Input

Input consist multiple case,each case consists of multiple lines. The first line will be an integer n (1 < n < 13) giving the number of straws on the table. Each of the next n lines contain 4 positive integers,x1,y1,x2 and y2, giving the coordinates, (x1,y1),(x2,y2) of the endpoints of a single straw. All coordinates will be less than 100. (Note that the straws will be of varying lengths.) The first straw entered will be known as straw #1, the second as straw #2, and so on. The remaining lines of the current case(except for the final line) will each contain two positive integers, a and b, both between 1 and n, inclusive. You are to determine if straw a can be connected to straw b. When a = 0 = b, the current case is terminated. 

When n=0,the input is terminated. 

There will be no illegal input and there are no zero-length straws. 

Output

You should generate a line of output for each line containing a pair a and b, except the final line where a = 0 = b. The line should say simply "CONNECTED", if straw a is connected to straw b, or "NOT CONNECTED", if straw a is not connected to straw b. For our purposes, a straw is considered connected to itself.

Sample Input

7
1 6 3 3 
4 6 4 9 
4 5 6 7 
1 4 3 5 
3 5 5 5 
5 2 6 3 
5 4 7 2 
1 4 
1 6 
3 3 
6 7 
2 3 
1 3 
0 0

2
0 2 0 0
0 0 0 1
1 1
2 2
1 2
0 0

0

Sample Output

CONNECTED 
NOT CONNECTED 
CONNECTED 
CONNECTED 
NOT CONNECTED 
CONNECTED
CONNECTED
CONNECTED
CONNECTED

题意：桌子上有n跟木棍，给出木棍端点的坐标。给定m对木棍，询问是否相交。通过相连的木棍间接相连也算。

思路：判断线段相交。先判断直线相交，再看交点是不是在线段上。

有几个细节，平行直线需要线段，间接相交因为数据范围比较小可以用floyd判断，精度控制应选择考虑误差的计算方法。

#include <stdio.h>
#include <string.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
using namespace std;
#define MAXN 10100
#define INF 1000000007
#define EPS 1e-10

//考虑误差的加减运算
double add(double a,double b){
    if(abs(a+b)<EPS*(abs(a)+abs(b)))
        return 0;
    else
        return a+b;
}



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);
    }
};

//判断点q是否在线段p1-p2上
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的交点
P intersection(P p1,P p2,P q1,P q2){
    return p1+(p2-p1)*((q2-q1).det(q1-p1)/(q2-q1).det(p2-p1));
}

int n;
P p[20],q[20];
int m;
int a[MAXN],b[MAXN];
bool g[20][20];

void solve(){
    for(int i=0;i<n;i++){
        g[i][i]=true;
        for(int j=0;j<i;j++){
            //判断木棍j和i有没有公共点
            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判断连通情况
        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)){
    if(n==0)
        break;
    for(int i=0;i<n;i++)
    {
        scanf("%lf%lf%lf%lf",&p[i].x,&p[i].y,&q[i].x,&q[i].y);
    }
    m=0;
    while(scanf("%d%d",&a[m],&b[m])){
        if(a[m]==0&&b[m]==0)
            break;
        m++;
    }
    solve();
    }
}