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
用叉积判断是否同正负即可
1 #include<iostream> 2 #include<cstring> 3 #include<string> 4 #include<algorithm> 5 #include<cmath> 6 #include<queue> 7 #include<vector> 8 #include<cstdio> 9 using namespace std; 10 11 struct Point{ 12 long long x,y; 13 }; 14 15 long long Cross(Point P,Point A,Point B){ 16 return (A.x-P.x)*(B.y-P.y)-(A.y-P.y)*(B.x-P.x); 17 } 18 19 20 int main(){ 21 int T; 22 scanf("%d",&T); 23 Point P,A,B,C; 24 while(T--){ 25 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); 26 long long ans1=Cross(A,B,P); 27 long long ans2=Cross(B,C,P); 28 long long ans3=Cross(C,A,P); 29 if((ans1<=0&&ans2<=0&&ans3<=0)||(ans1>=0&&ans2>=0&ans3>=0)){ 30 puts("YES"); 31 } 32 else{ 33 puts("NO"); 34 } 35 } 36 37 }
posted on 2018-10-26 15:02 Fighting_sh 阅读(233) 评论(0) 编辑 收藏 举报
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步