#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
struct point{
int x,y;
} p[30];
struct line{
point a,b;
}L[30];
int cp(point p1,point p2,point p3){
return (p2.x-p1.x)*(p3.y-p1.y)-(p2.y-p1.y)*(p3.x-p1.x);
}
bool interesect(point p1,point p2,point p3,point p4){
if((max(p1.x,p2.x)<min(p3.x,p4.x))||(min(p1.x,p2.x)>max(p3.x,p4.x))||(max(p1.y,p2.y)<min(p3.y,p4.y))||(min(p1.y,p2.y)>max(p3.y,p4.y)))
return 0;
if(cp(p3,p4,p1)*cp(p3,p4,p2)<=0&&cp(p1,p2,p3)*cp(p1,p2,p4)<=0)
return 1;
else
return 0;
}
int map[30][30];
int main(){
int n,i,j,k,a,b;
while(~scanf("%d",&n)&&n)
{
for(i=1;i<30;i++)
for(j=1;j<30;j++)
map[i][j]=0;
for(i=1;i<=n;i++)
{
scanf("%d%d%d%d",&L[i].a.x,&L[i].a.y,&L[i].b.x,&L[i].b.y);
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i==j)
continue;
if(interesect(L[i].a,L[i].b,L[j].a,L[j].b))
{
map[i][j]=map[j][i]=1;
}
}
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
map[i][j]|=map[i][k]&&map[k][j];
while(1)
{
scanf("%d%d",&a,&b);
if(a==0&&b==0)
break;
if(a==b)
printf("CONNECTED\n");
else if(map[a][b]||map[b][a])
printf("CONNECTED\n");
else
printf("NOT CONNECTED\n");
}
}
}
poj 1127 计算几何
最新推荐文章于 2022-02-20 17:14:33 发布