Inside Triangle

Inside Triangle

https://hihocoder.com/contest/hiho225/problem/1

时间限制:10000ms

单点时限:1000ms

内存限制:256MB

描述

Determine if a point is inside a 2D triangle.

输入

The first line contains an integer T denoting the number of test case. (1 <= T <= 10)

The following T lines each contain 8 integers, Px, Py, Ax, Ay, Bx, By, Cx, Cy. P denotes the point. ABC denotes the triangle. The coordinates are within [-1000000, 1000000].

输出

For each test case output YES or NO denoting if the point is inside the triangle. Note that the point is considered inside the triangle if the point is just on some side of the triangle.

样例输入

2
0 1 -1 0 1 0 0 2
0 0 0 1 1 0 1 1

样例输出

YES
NO

用叉积判断是否同正负即可

 #include<iostream>
 #include<cstring>
 #include<string>
 #include<algorithm>
 #include<cmath>
 #include<queue>
 #include<vector>
 #include<cstdio>
 using namespace std;

 struct Point{
     long long x,y;
 };

 long long Cross(Point P,Point A,Point B){
     return (A.x-P.x)*(B.y-P.y)-(A.y-P.y)*(B.x-P.x);
 }

 int main(){
     int T;
     scanf("%d",&T);
     Point P,A,B,C;
     while(T--){
         scanf("%lld %lld %lld %lld %lld %lld %lld %lld",&P.x,&P.y,&A.x,&A.y,&B.x,&B.y,&C.x,&C.y);
         long long ans1=Cross(A,B,P);
         long long ans2=Cross(B,C,P);
         long long ans3=Cross(C,A,P);
         if((ans1<=&&ans2<=&&ans3<=)||(ans1>=&&ans2>=&ans3>=)){
             puts("YES");
         }
         else{
             puts("NO");
         }
     }

 }