Naive and Silly Muggles(计算几何 判断点是否在三点形成的最小圆内)
来源:互联网 发布:c语言用户标识符的 编辑:程序博客网 时间:2024/04/27 14:27
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4720
Problem Description
Three wizards are doing a experiment. To avoid from bothering, a special magic is set around them. The magic forms a circle, which covers those three wizards, in other words, all of them are inside or on the border of the circle. And due to save the magic power, circle's area should as smaller as it could be.
Naive and silly "muggles"(who have no talents in magic) should absolutely not get into the circle, nor even on its border, or they will be in danger.
Given the position of a muggle, is he safe, or in serious danger?
Naive and silly "muggles"(who have no talents in magic) should absolutely not get into the circle, nor even on its border, or they will be in danger.
Given the position of a muggle, is he safe, or in serious danger?
Input
The first line has a number T (T <= 10) , indicating the number of test cases.
For each test case there are four lines. Three lines come each with two integers xi and yi (|xi, yi| <= 10), indicating the three wizards' positions. Then a single line with two numbers qx and qy (|qx, qy| <= 10), indicating the muggle's position.
For each test case there are four lines. Three lines come each with two integers xi and yi (|xi, yi| <= 10), indicating the three wizards' positions. Then a single line with two numbers qx and qy (|qx, qy| <= 10), indicating the muggle's position.
Output
For test case X, output "Case #X: " first, then output "Danger" or "Safe".
Sample Input
30 02 01 21 -0.50 02 01 21 -0.60 03 01 11 -1.5
Sample Output
Case #1: DangerCase #2: SafeCase #3: Safe
Source
2013 ACM/ICPC Asia Regional Online —— Warmup2
题意:
判断点是否在三点形成的最小圆内,在圆外输出Danger,圆内输出Safe!
PS:
首先确定这三个点构成的是否是钝角三角形?
如果是,则形成的那个圆的半径是前面三个点形成的距离中最远的距离的一半,圆心就是那两个点的中点,然后判断第四个点到圆心的距离与半径进行比较;
如果这三个点形成的不是钝角三角形,圆心就是三角形的外接圆的圆心,然后进行判断;
代码如下:#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>#include <iostream>using namespace std;struct point{ double x, y;} a[4];double rr;//半径point C, p;double dis(point a, point b){ return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));}int judge(int d1, int d2, int d3){ if(d1*d1 > d2*d2+d3*d3) { C.x = (a[1].x+a[2].x)/2.0; C.y = (a[1].y+a[2].y)/2.0; rr = d1/2.0; return 1; } else if(d2*d2 > d1*d1+d3*d3) { C.x = (a[1].x+a[3].x)/2.0; C.y = (a[1].y+a[3].y)/2.0; rr = d2/2.0; return 1; } else if(d3*d3 > d1*d1+d2*d2) { C.x = (a[2].x+a[3].x)/2.0; C.y = (a[2].y+a[3].y)/2.0; rr = d3/2.0; return 1; } return 0;}int main(){ int t; int cas = 0; scanf("%d",&t); while(t--) { printf("Case #%d: ",++cas); for(int i = 1; i <= 3; i++) { scanf("%lf%lf",&a[i].x,&a[i].y); } scanf("%lf%lf",&p.x,&p.y); double d1 = dis(a[1], a[2]); double d2 = dis(a[1], a[3]); double d3 = dis(a[2], a[3]); if(judge(d1,d2,d3))//如果是钝角 { double disl = dis(p,C); if(disl > rr) { printf("Safe\n"); } else { printf("Danger\n"); } } else { double x1 = a[1].x, y1 = a[1].y; double x2 = a[2].x, y2 = a[2].y; double x3 = a[3].x, y3 = a[3].y; C.x = ((y3-y1)*(y2*y2-y1*y1+x2*x2-x1*x1)+(y2-y1)*(y1*y1-y3*y3+x1*x1-x3*x3))/(2*(x2-x1)*(y3-y1)-2*(x3-x1)*(y2-y1)); C.y = ((x3-x1)*(x2*x2-x1*x1+y2*y2-y1*y1)+(x2-x1)*(x1*x1-x3*x3+y1*y1-y3*y3))/(2*(y2-y1)*(x3-x1)-2 *(y3-y1)*(x2-x1)); double disl = dis(p,C); rr = dis(C,a[1]); if(disl > rr) { printf("Safe\n"); } else { printf("Danger\n"); } } } return 0;}
1 0
- Naive and Silly Muggles(计算几何 判断点是否在三点形成的最小圆内)
- hdu 4720 Naive and Silly Muggles (计算几何)
- HDU 4720 Naive and Silly Muggles(计算几何)
- HDU 4720 Naive and Silly Muggles(几何)
- hdu 4720 Naive and Silly Muggles(几何)
- Naive and Silly Muggles
- Naive and Silly Muggles
- HDU 4720 Naive and Silly Muggles(计算几何, 求三角形外心)
- HDU4720----Naive and Silly Muggles
- HDU4720-Naive and Silly Muggles
- HDU4720 Naive and Silly Muggles
- hdu4720-(Naive and Silly Muggles)
- 计算几何----判断点是否在一个矩形内
- A Circle and a Square----计算几何,判断点是否在图形内
- Naive and Silly Muggles(判断钝角与三点共园)
- hdu 4720 Naive and Silly Muggles 外接圆(计算几何) 2013 ACM/ICPC Asia Regional Online —— Warmup2 1005
- hdu 4720 Naive and Silly Muggles
- HDU 4720 Naive and Silly Muggles
- 第十六周OJ——3 相同数字
- android 关于视频取某时间段的帧转化为bitmap后循环播出问题
- 常立志,不如立长志
- 第十六周OJ——4 奇数因子
- UVA10305 Ordering Tasks【DFS】【拓扑排序】
- Naive and Silly Muggles(计算几何 判断点是否在三点形成的最小圆内)
- HDOJ 5058 So easy
- 数据结构与算法:快速排序
- 黑马程序员——学习笔记——多线程
- CI批量插入数据方法
- ACM投票——二分法
- POJ 2528
- C语言中用pow(a,b)表示次方,而不是a^b.....
- MATLAB中PCA函数princomp个人理解