（计算几何）POJ1269Intersecting Lines

POJ1269Intersecting Lines

题意：

给你两条直线，相交输出交点，重合输出“LINE”，平行输出“NONE”。

思路：

直线相交的模板题，就是在平行和重合的时候可以用叉乘判断。
注意点： 提交G++的时候，不要用%.2lf，要用%.2f。

代码：

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<string.h>
#include<ctype.h>
#include<queue>
#include<set>
#include<stack>
#include<cmath>
#include<map>
#define pii pair<int,int>
#define ll long long
#define cl(x,y) memset(x,y,sizeof(x))
#define ct cerr<<"Time elapsed:"<<1.0*clock()/CLOCKS_PER_SEC<<"s.\n";
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define lson x<<1,l,mid
#define rson x<<1|1,mid+1,r
#define INF 1e18
const int N=1e6+10;
const int mod=1e9+7;
const int inf=0x3f3f3f3f;
const double eps=1e-8;
const double pi=acos(-1);
using namespace std;
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 xx,double yy){x=xx;y=yy;}
    point operator +(point b){return point(x+b.x,y+b.y);}
    point operator -(point b){return point(x-b.x,y-b.y);}
    double operator ^(point b){return x*b.y-y*b.x;}//叉乘 
    double operator *(point b){return x*b.x+y*b.y;}//点乘 
    point operator *(double b){return point(x*b,y*b);}//数乘   
    void read(){scanf("%lf%lf",&x,&y);}
};
struct line
{
    point s,e,l;
    line(){}
    line(point ss,point ee){s = ss;e = ee;l=e-s;}
    void read(){s.read(),e.read();l=e-s;}
};
point getcross(line l1,line l2)
{
	double s1=((l2.s-l1.s)^(l2.e-l1.s));
	double s2=((l2.e-l1.e)^(l2.s-l1.e));
	if(s1+s2==0)
		return point{inf,inf};
	return l1.s+l1.l*(s1/(s1+s2));
}
int main()
{
	int t;
	scanf("%d",&t);
	printf("INTERSECTING LINES OUTPUT\n");
	while(t--)
	{
		line l1,l2;
		l1.read();
		l2.read();
		point p=getcross(l1,l2);
		if(p.x==inf && p.y==inf)
		{
			if(sgn((l2.e-l1.s)^l1.l)==0)
				printf("LINE\n");
			else
				printf("NONE\n");
		}
		else
			printf("POINT %.2f %.2f\n",p.x,p.y);
	}	
	printf("END OF OUTPUT\n");
	return 0;
}