POJ - 1066 Treasure Hunt（线段相交）

链接：https://cn.vjudge.net/problem/POJ-1066

题意：100*100的矩形内有n条线段，给出一个点，问从矩形外面到该点最少要穿过几条线段？也就是从该点引一条向外的射线，最少与几条线段相交？

思路：这条射线肯定过这n条线段的一个端点，枚举判断即可。

#include <cstdio>
#include <iostream>
#include <cmath>
#define ll long long
using namespace std;
const double eps = 1e-8;
const int N = 30+10;
int sgn(double x)
{
	if(fabs(x)<eps) return 0;
	else if(x<0) return -1;
	else return 1;
}
struct Point
{
	double x,y;
	Point(){}
	Point(double x,double y):x(x),y(y){}
	Point operator -(const Point& b)const//相减 
	{
		return Point(x-b.x,y-b.y);
	}
	double operator ^(const Point& b)const//叉乘 
	{
		return x*b.y-y*b.x;
	}
	double operator *(const Point& b)const//点乘 
	{
		return x*b.x+y*b.y;
	}
}s,e;
struct Line
{
	Point s,e;
	Line(){}
	Line(Point ss,Point ee){ s=ss,e=ee;}
}ls[N],l;
int ans,num;
int n;
double x1,y1,x2,y2;
double dist(Point a,Point b)
{
	return sqrt((a-b)*(a-b));
}
//判断线段相交 
bool inter(Line l1,Line l2)
{
	return max(l1.s.x,l1.e.x)>=min(l2.s.x,l2.e.x)
	&& max(l2.s.x,l2.e.x)>=min(l1.s.x,l1.e.x)
	&& max(l1.s.y,l1.e.y)>=min(l2.s.y,l2.e.y)
	&& max(l2.s.y,l2.e.y)>=min(l1.s.y,l1.e.y)
	&& sgn((l2.s-l1.s)^(l1.e-l1.s))*sgn((l2.e-l1.s)^(l1.e-l1.s))<=0
	&& sgn((l1.s-l2.s)^(l2.e-l2.s))*sgn((l1.e-l2.s)^(l2.e-l2.s))<=0;
}

int main(void)
{
	while(~scanf("%d",&n))
	{
		ans=1e9;
		for(int i=1;i<=n;i++)
		{
			scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);			
			ls[i]=Line(Point(x1,y1),Point(x2,y2));
		}
		scanf("%lf%lf",&s.x,&s.y);
		for(int i=1;i<=n;i++)
		{
			e=ls[i].s;
			l=Line(s,e);
			num=0;
			for(int j=1;j<=n;j++)
				if(inter(l,ls[j]))
					num++;
			ans=min(ans,num);
			e=ls[i].e;
			l=Line(s,e);
			num=0;
			for(int j=1;j<=n;j++)
				if(inter(l,ls[j]))
					num++;
			ans=min(ans,num);	
		}		
		if(ans==1e9) ans=1;
		printf("Number of doors = %d\n",ans);
	}
		
	return 0;
}