Segment set(hdu1558并查集+计算机和)

题意：给你一些线段坐标，判断线段是否相交，线段相交的属于一类，只要和这一类中任何一段线段相交，那他们就属于一类，给你一条线段，输出和他一类的有多少种

思路：判断线段是否在同一集合，用并查集，每次假如一个线段，遍历现有的线段和哪个相交就和哪个合并，然后根节点的秩+1，最后输出该节点父亲节点的秩就行了。

现在判断线段相交。

1.一个线段的两个点在另一个线段的两边，那么该线段就相交，用向量的叉乘，跨立实验，

2.有可能两条线段重合相交，必须判断以线段为对角线所在的矩形是否相交，快速排斥。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct bian
{
    double x1,x2,y1,y2;
    int father;
}p[1010];
int rank[1010];

void Make_set(int n)
{
    int i;
    for(i = 1; i <= n; i++)
    {
        p[i].father = i;
        rank[i] = 1;
    }
}

int Find_set(int x)
{
    if(x != p[x].father)
    {
        p[x].father = Find_set(p[x].father);
    }
    return p[x].father;
}

double Max(double a,double b)
{
    if(a > b)
        return a;
    else
        return b;
}

double Min(double a,double b)
{
    if(a < b)
        return a;
    else
        return b;
}

bool xiangjiao(bian a,bian b)
{
    if(Min(a.x1,a.x2) <= Max(b.x1,b.x2) && Min(b.x1,b.x2) <= Max(a.x1,a.x2) && Min(a.y1,a.y2) <= Max(b.y1,b.y2) && Min(b.y1,b.y2) <= Max(a.y1,a.y2))
    {
        double temp1 = (a.x2-a.x1)*(b.y1-a.y1)-(b.x1-a.x1)*(a.y2-a.y1);
        double temp2 = (a.x2-a.x1)*(b.y2-a.y1)-(b.x2-a.x1)*(a.y2-a.y1);
        double temp3 = (b.x2-b.x1)*(a.y2-b.y1)-(a.x2-b.x1)*(b.y2-b.y1);
        double temp4 = (b.x2-b.x1)*(a.y1-b.y1)-(a.x1-b.x1)*(b.y2-b.y1);
        if(temp1*temp2 <= 0 && temp3*temp4 <= 0)
        {
            return true;
        }
    }
    return false;
}

void Union(int a,int b)
{
    int x = Find_set(a);
    int y = Find_set(b);
    if(x == y)
        return ;
    else
    {
        p[x].father = y;
        rank[y] += rank[x];
    }
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int i,n,sum = 0,num;
        char c[5];
        //printf("qingshuru \n");
        scanf("%d",&n);
        Make_set(n);
        for(i = 1; i <= n; i++)
        {
            scanf("%s",c);
            if(c[0] == 'P')
            {
                sum++;
                scanf("%lf%lf%lf%lf",&p[sum].x1,&p[sum].y1,&p[sum].x2,&p[sum].y2);
                for(int j = 1; j < sum; j++)
                {
                    if(xiangjiao(p[j],p[sum]))
                        Union(j,sum);
                    
                }
            }
            else
            {
                scanf("%d",&num);
                printf("%d\n",rank[Find_set(num)]);
            }
        }
        if(t != 0)
            printf("\n");

    }
    return 0;
}