51nod 1264 线段相交

#include <bits/stdc++.h>
using namespace std;

int main()
{
	long long T,i,x[5],y[5],d[5];
	cin>>T;
	while(T--)
	{
		for(i=0;i<4;i++)
			scanf("%lld%lld",&x[i],&y[i]);
		d[0]=(y[1]-y[0])*x[2]-(x[1]-x[0])*y[2]+x[1]*y[0]-x[0]*y[1];
		d[1]=(y[1]-y[0])*x[3]-(x[1]-x[0])*y[3]+x[1]*y[0]-x[0]*y[1];
		d[2]=(y[3]-y[2])*x[0]-(x[3]-x[2])*y[0]+x[3]*y[2]-x[2]*y[3];
		d[3]=(y[3]-y[2])*x[1]-(x[3]-x[2])*y[1]+x[3]*y[2]-x[2]*y[3];
		for(i=0;i<4;i++)
		{
			if(d[i]>0)
				d[i]=1;
			if(d[i]==0)
				d[i]=0;
			if(d[i]<0)
				d[i]=-1;
		}
		if(d[0]*d[1]<=0&&d[2]*d[3]<=0)
			printf("Yes\n");
		else
			printf("No\n");
	}
}