POJ-1269 Intersecting Lines

最新推荐文章于 2021-08-01 00:28:16 发布

_zlWang

最新推荐文章于 2021-08-01 00:28:16 发布

阅读量245

点赞数

本文链接：https://blog.csdn.net/wl16wzl/article/details/81982820

版权

一道模板题，判断直线重合，平行还是相交

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
const double eps=1e-8;
const double PI=acos(-1.0);
int sgn(double x)
{
	if(fabs(x)<eps) return 0;
	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;
	}
	///绕原点旋转角度B（弧度值），后x,y的变化 
	void transXY(double B)
	{
		double tx=x,ty=y;
		x=tx*cos(B)-ty*sin(B);
		y=tx*sin(B)+ty*cos(B);
	}
};
struct Line
{  
	Point s,e;  
 	Line(){}  
 	Line(Point _s,Point _e)  {   s = _s;e = _e;  }  
 	//两直线相交求交点  
 	//第一个值为0表示直线重合，为1表示平行，为0表示相交,为2是相交 
 	 //只有第一个值为2时，交点才有意义     
 	pair<int,Point> operator &(const Line &b)const     
 	{        
 	    Point res = s;        
 	  	if(sgn((s-e)^(b.s-b.e)) == 0)      
 	    {            
 	    	if(sgn((s-b.e)^(b.s-b.e)) == 0)               
 	        	return make_pair(0,res);//重合           
 	        else return make_pair(1,res);//平行        
 	    }         
 	    double t = ((s-b.s)^(b.s-b.e))/((s-e)^(b.s-b.e));     
        res.x += (e.x-s.x)*t;    
 	    res.y += (e.y-s.y)*t;        
 	    return make_pair(2,res);     
 	}
}a,b; 
int main()
{
	int n;
	scanf("%d",&n);
	printf("INTERSECTING LINES OUTPUT\n");
	while(n--)
	{
		scanf("%lf%lf%lf%lf%lf%lf%lf%lf",&a.s.x,&a.s.y,&a.e.x,&a.e.y,&b.s.x,&b.s.y,&b.e.x,&b.e.y);
		pair<int,Point> ans=a&b;
		if(ans.first==0) printf("LINE\n");
		else if(ans.first==1) printf("NONE\n");
		else printf("POINT %.2f %.2f\n",ans.second.x,ans.second.y);
	}
	printf("END OF OUTPUT\n");
	return 0;
}