TZOJ 1840 Jack Straws(线段相交+并查集)

描述

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 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.

输出

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.

样例输入

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

样例输出

CONNECTED
NOT CONNECTED
CONNECTED
CONNECTED
NOT CONNECTED
CONNECTED
CONNECTED
CONNECTED
CONNECTED

题意

给你n条线的两个端点坐标，有m个询问，两条线是否连通

题解

首先判断任意两条线是否相交，再把相交的加入并查集

代码

 #include<stdio.h>
 #include<algorithm>
 using namespace std;
 
 int f[];
 int Find(int x)
 {
     int r=x;
     while(f[r]!=r)
         r=f[r];
     int i=x,j;
     while(i!=r)
     {
         j=f[i];
         f[i]=r;
         i=j;
     }
     return r;
 }
 void join(int x,int y)
 {
     int a,b;
     a=Find(x);
     b=Find(y);
     if(a!=b)
         f[a]=b;
 }
 void init()
 {
     for(int i=;i<=;i++)
         f[i]=i;
 }
 
 struct point{double x,y;};
 bool judge(point a,point b,point c,point d)
 {
     //用矩形是否重叠快速排斥(共线能通过跨立不行的要排掉)
     if(!(min(a.x,b.x)<=max(c.x,d.x)&&min(c.y,d.y)<=max(a.y,b.y)
         &&min(c.x,d.x)<=max(a.x,b.x)&&min(a.y,b.y)<=max(c.y,d.y)))
         return false;
     //跨立
     double u,v,w,z;
     u=(c.x-a.x)*(b.y-a.y)-(b.x-a.x)*(c.y-a.y);//u为正说明cb在ab的顺时针
     v=(d.x-a.x)*(b.y-a.y)-(b.x-a.x)*(d.y-a.y);//db和ab
     w=(a.x-c.x)*(d.y-c.y)-(d.x-c.x)*(a.y-c.y);//ad和cd
     z=(b.x-c.x)*(d.y-c.y)-(d.x-c.x)*(b.y-c.y);//bd和cd
     return (u*v<=0.00000001&&w*z<=0.00000001);
 }
 
 struct line
 {
     point p1,p2;
 }l[];
 int main()
 {
     int n;
     while(scanf("%d",&n)!=EOF,n)
     {
         init();
         for(int i=;i<=n;i++)
         {
             scanf("%lf%lf%lf%lf",&l[i].p1.x,&l[i].p1.y,&l[i].p2.x,&l[i].p2.y);
         }
         for(int i=;i<=n;i++)
         {
             for(int j=;j<=n;j++)
             {
                 if(i==j)continue;
                 if(judge(l[i].p1,l[i].p2,l[j].p1,l[j].p2))
                     join(i,j);
             }
         }
         int a,b;
         while(scanf("%d%d",&a,&b)!=EOF,a||b)
         {
             a=Find(a);
             b=Find(b);
             if(a==b)
                 printf("CONNECTED\n");
             else
                 printf("NOT CONNECTED\n");
         }
     }
     return ;
 }