hdu 1558 并查集加判断线段相交

最新推荐文章于 2022-02-25 22:41:09 发布

YDYKL

最新推荐文章于 2022-02-25 22:41:09 发布

阅读量476

点赞数

分类专栏：并查集文章标签： struct c

本文链接：https://blog.csdn.net/YDYKL/article/details/6612439

版权

并查集专栏收录该内容

1 篇文章 0 订阅

订阅专栏

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define eps 1e-8
using namespace std;
int fa[1010],num[1010];

struct node
{
double x1,y1;
double x2,y2;
}seg[1010];

int getfa(int a)
{
    if(a!=fa[a])
        fa[a]=getfa(fa[a]);
    return fa[a];
}
int max(int a,int b) {if(a>b) return a;return b;}
int min(int a,int b) {if(a<b) return a;return b; }

double multiply1(node a,node b)
{
return (a.x1-a.x2)*(b.y1-a.y1)-(a.y1-a.y2)*(b.x1-a.x1);
}
double multiply2(node a,node b)
{
return (a.x1-a.x2)*(b.y2-a.y1)-(a.y1-a.y2)*(b.x2-a.x1);
}

bool inter(node a,node b)
{
      if(max(a.x1,a.x2)>=min(b.x1,b.x2)&&
      max(b.x1,b.x2)>=min(a.x1,a.x2)&&
      max(a.y1,a.y2)>=min(b.y1,b.y2)&&
      max(b.y1,b.y2)>=min(a.y1,a.y2)&&
      multiply1(a,b)*multiply2(a,b)<=eps&&
      multiply1(b,a)*multiply2(b,a)<=eps)
      return true;
      else return false;
}
int main()
{
    int t,n,m,i,j,x,y;
    char ch[2];
    scanf("%d",&t);
    for(int k=0;k<t;k++)
    {
        if(k!=0) printf("\n");
scanf("%d%*c",&n);
        for(i=1;i<=n;i++)
        {
           fa[i]=i;
           num[i]=1;
        }
        i=1;
        while(n--)
        {
            scanf("%s",ch);
            if(ch[0]=='P')
            {
                scanf("%lf%lf%lf%lf%*c",&seg[i].x1,&seg[i].y1,&seg[i].x2,&seg[i].y2);
                for(j=1;j<i;j++)
                {
                     if(inter(seg[j],seg[i]))
                     {
                           x=getfa(j);
                           y=getfa(i);
                           if(x!=y)
                           {
                                fa[y]=x;
                                num[x]+=num[y];
                           }
                     }
                }
                i++;
            }
            else if(ch[0]=='Q')
            {
                scanf("%d%*c",&m);
                int a=getfa(m);
                printf("%d\n",num[a]);
            }
        }
    }
    return 0;