poj 3304 叉积

题意：是否有一条直线穿过所有的线段；

解法：叉积

叉积公式和前面两篇一样。

/*************************************************************************
    > File Name: poj3304.cpp
    > Author: 
    > Mail: 
    > Created Time: 2014/8/12 22:00:05
 ************************************************************************/
#include<iostream>
#include<cstring>
#include <algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#define maxn 50000+5
#define inf 0x3f3f3f3f
  #define INF 0x3FFFFFFFFFFFFFFFLL
#define rep(i,n) for(i=0;i<n;i++)
 #define reP(i,n) for(i=1;i<=n;i++)
#define ull unsigned long long
 #define ll long long
#define cle(a) memset(a,0,sizeof(a))
const double  eps= 1e-8;
using namespace std;
struct line{
  double x1,y1,x2,y2;
};
line val[maxn];
int n,m;
double dis(double x1,double y1,double x2,double y2){
	return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
double getbool(double x1,double y1,double x2,double y2,double x3,double y3){
return (x2-x1)*(y3-y1)-(y2-y1)*(x3-x1);  
}
bool judge(double x1,double y1,double x2,double y2){
	int i,j,k;
	if(dis(x1,y1,x2,y2)<eps)
	{
	    return 0;
	}
	rep(i,n){
		double temp1=getbool(val[i].x1,val[i].y1,x1,y1,x2,y2);
		double temp2=getbool(val[i].x2,val[i].y2,x1,y1,x2,y2);
		if(temp1*temp2>eps)return 0;
	}
	return 1;
}
int main()
{
    freopen("in.txt","r",stdin); 
	int T;
	cin>>T;
	while(T--){
		 scanf("%d",&n);
         int i,j,k;
		 rep(i,n){
			 scanf("%lf%lf%lf%lf",&val[i].x1,&val[i].y1,&val[i].x2,&val[i].y2);
		 }
		 if(n==1||n==2){
			 printf("Yes!\n");
			 continue;
		 }
		 bool flag=false;
		 for(i=0;i<n&&!flag;i++){
			 for(j=i+1;j<n&&!flag;j++){
				 if(judge(val[i].x1,val[i].y1,val[j].x1,val[j].y1)||judge(val[i].x1,val[i].y1,val[j].x2,val[j].y2)||
						 judge(val[i].x2,val[i].y2,val[j].x1,val[j].y1)||judge(val[i].x2,val[i].y2,val[j].x2,val[j].y2)){
					 flag=true;
				 }
			 }
		 }
		 if(flag)printf("Yes!\n");
		 else printf("No!\n");
	}
    return 0;
}