链接:点击打开链接
题意:判断两直线是否相交
代码:
#include <iostream>
using namespace std;
struct node{
double stx,sty;
double enx,eny;
};
double cross1(node p,node q){
return (p.stx-p.enx)*(q.sty-p.sty)-(p.sty-p.eny)*(q.stx-p.stx);
}
double cross2(node p,node &q){
return (p.stx-p.enx)*(q.eny-p.sty)-(p.sty-p.eny)*(q.enx-p.stx);
}
int judge(node p,node q){
if(max(p.stx,p.enx)>=min(q.stx,q.enx)&&
max(q.stx,q.enx)>=min(p.stx,p.enx)&&
max(p.sty,p.eny)>=min(q.sty,q.eny)&&
max(q.sty,q.eny)>=min(p.sty,p.eny)&&
cross1(p,q)*cross2(p,q)<=0&&
cross1(q,p)*cross2(q,p)<=0)
return 1;
return 0;
} //线段相交的模板方便以后使用
int main(){
int t;
node p,q;
cin>>t;
while(t--){
cin>>p.stx>>p.sty>>p.enx>>p.eny;
cin>>q.stx>>q.sty>>q.enx>>q.eny;
if(judge(p,q)==1)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
return 0;
}