题意:当输入P的时候,画一条线段,并且线段是有标号顺序的,如果两个线段相交即相当于联通了,
当输入Q的时候询问这个与这条线段联通的线段有几条(包括它本身)
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
struct point
{
double x;
double y;
};
typedef struct line
{
point start,end;
} vec;
double multi(point p1,point p2,point p0)
{
return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}
bool cross(vec v1,vec v2)
{
if(/*max(v1.start.x,v1.end.x)>=min(v2.start.x,v2.end.x)&&
max(v2.start.x,v2.end.x)>=min(v1.start.x,v1.end.x)&&
max(v1.start.y,v1.end.y)>=min(v2.start.y,v2.end.y)&&*/
multi(v2.start,v1.end,v1.start)*multi(v1.end,v2.end,v1.start)>=0&&
multi(v1.start,v2.end,v2.start)*multi(v2.end,v1.end,v2.start)>=0)
return true;
else return false;
}
vec data[1005];
int pre[1005];
int find(int n)
{
if(n!=pre[n])
{
pre[n]=find(pre[n]);
}
return pre[n];
}
void mix(int x,int y)
{
if(find(x)!=find(y)) pre[find(y)]=find(x);
}
int main()
{
int t;
while(scanf("%d",&t)!=-1)
{
while(t--)
{
memset(data,0,sizeof(data));
int n;
scanf("%d",&n);
for(int i=1; i<=n; i++)
{
pre[i]=i;
}
int k=0;
while(n--)
{
char ch[5];
scanf("%s",&ch);
if(ch[0]=='P')
{
k++;
scanf("%lf%lf%lf%lf",&data[k].start.x,&data[k].start.y,&data[k].end.x,&data[k].end.y);
for(int j=1; j<=k-1; j++)
if(cross(data[j],data[k])) mix(k,j);
}
if(ch[0]=='Q')
{
int a;
scanf("%d",&a);
int ans=0;
for(int i=1;i<=k;i++)
{
if(find(i)==find(a)) ans++;
}
printf("%d\n",ans);
}
}
if(t) printf("\n");//注意当不是最后一组数据时要输出一个回车(There is a blank line between test cases.)
}
}
return 0;
}