题目描述
题解
不知道为什么这道题
O(n2)
暴力就可以
然后就是判断线段是否相交
首先一条线段确定一个向量,在由这个向量的起点向另一条线段的两个端点引两个向量,把这两个向量分别和第一个向量做叉积然后判断是否异号
两条线段共线的情况还需要特判一下
需要正反做两次,否则只是判断直线和线段相交的做法
代码
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
#define N 100005
const double eps=1e-9;
int dcmp(double x)
{
if (x<=eps&&x>=-eps) return 0;
return (x>0)?1:-1;
}
struct Vector
{
double x,y;
Vector(double X=0,double Y=0)
{
x=X,y=Y;
}
};
typedef Vector Point;
struct Line
{
Point p,q;
Line(Point P=Point(0,0),Point Q=Point(0,0))
{
p=P,q=Q;
}
};
Vector operator - (Vector A,Vector B) {return Vector(A.x-B.x,A.y-B.y);}
int n;
double a,b,c,d;
Line l[N];
int ans[N];
void clear()
{
memset(ans,0,sizeof(ans));
}
double Dot(Vector A,Vector B)
{
return A.x*B.x+A.y*B.y;
}
double Cross(Vector A,Vector B)
{
return A.x*B.y-A.y*B.x;
}
bool check(Line l,Line m)
{
Vector v1,v2,v3;
double x,y;
bool flag=true;
v1=l.p-l.q;v2=m.p-l.q;v3=m.q-l.q;
x=dcmp(Cross(v1,v2));y=dcmp(Cross(v1,v3));
if ((x==y&&x)||(!x&&!y&&dcmp(Dot(v2,v3))>=0)) flag=false;
v1=m.p-m.q;v2=l.p-m.q;v3=l.q-m.q;
x=dcmp(Cross(v1,v2));y=dcmp(Cross(v1,v3));
if ((x==y&&x)||(!x&&!y&&dcmp(Dot(v2,v3))>=0)) flag=false;
return flag;
}
int main()
{
while (~scanf("%d",&n))
{
if (!n) break;
clear();
printf("Top sticks: ");
for (int i=1;i<=n;++i)
{
scanf("%lf%lf%lf%lf",&a,&b,&c,&d);
l[i]=Line(Point(a,b),Point(c,d));
}
for (int i=1;i<=n;++i)
{
bool flag=true;
for (int j=i+1;j<=n;++j)
if (check(l[i],l[j])) {flag=false;break;}
if (flag) ans[++ans[0]]=i;
}
for (int i=1;i<=ans[0];++i)
{
printf("%d",ans[i]);
if (i!=ans[0]) printf(", ");
else puts(".");
}
}
}