UVa 10697 - Firemen barracks

题目：已知三点，求到三点距离相同的点。

分析：计算几何。分三类情况讨论：

1.三点共线，不成立；

2.多点重叠，有多组解；

3.是三角形，输出中点。

说明：注意绝对值小于0.05的按0计算；负数的四舍五入与正数不同，-0.05的%.1lf输出是 -0.0。

#include <stdio.h>
#include <stdlib.h>
#include <math.h>double dist( double x0, double y0, double x1, double y1 )
{return sqrt((x1-x0)*(x1-x0)+(y1-y0)*(y1-y0));
}double deal( double x )
{double esp = 1e-6;if ( x + esp < 0.05 && x - esp > -0.05 )return 0.0;else if ( x < 0.0 )return x - esp;else return x;}void calc( double x0, double y0, double x1, double y1, double x2, double y2 )
{double a  = dist( x0, y0, x1, y1 );double b  = dist( x0, y0, x2, y2 );double c  = dist( x2, y2, x1, y1 );if ( x0 == x1 && y1 == y0 || x0 == x2 && y2 == y0 || x2 == x1 && y1 == y2 ) {printf("There is an infinity of possible locations.\n");return;}if ( fabs(a-b-c) < 1e-9 || fabs(b-a-c) < 1e-9 || fabs(c-a-b) < 1e-9 ) {printf("There is no possible location.\n");return;}double A1 = x1-x0,B1 = y1-y0,C1 = x1*x1-x0*x0+y1*y1-y0*y0;double A2 = x2-x0,B2 = y2-y0,C2 = x2*x2-x0*x0+y2*y2-y0*y0;double X  = (B1*C2-B2*C1)/(A1*B2-A2*B1)/-2.0;double Y  = (A2*C1-A1*C2)/(A1*B2-A2*B1)/-2.0;printf("The equidistant location is (%.1lf, %.1lf).\n",deal(X),deal(Y));
}int main()
{int n;double x1,x2,x3,y1,y2,y3;while ( ~scanf("%d",&n) ) while ( n -- ) {scanf("%lf%lf%lf%lf%lf%lf",&x1,&y1,&x2,&y2,&x3,&y3);calc( x1, y1, x2, y2, x3, y3 );}return 0;
}

UVa 10697 - Firemen barracks相关推荐

一位学长的ACM总结（感触颇深）
发信人: fennec (fennec), 信区: Algorithm 标题: acm 总结 by fennec 发信站: 吉林大学牡丹园站 (Wed Dec 8 16:27:55 2004) AC ...
[搜索]UVa 129 困难的串
题意:将一个包含两个相邻的重复子串的子串,称为"容易的串",其他为"困难的串". 输入正整数n和l,输出由前l个字符组成的,字典序第n小的困难的串. 输入样例: ...
uva 401.Palindromes
题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem ...
Uva 3767 Dynamic len(set(a[L:R])) 树套树
Dynamic len(set(a[L:R])) Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 https://uva.onlinejudge.org/in ...
UVA 11752 超级幂
UVA 11752 超级幂 Z - The Super Powers Time Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & ...
UVa 11174 - Stand in a Line
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&p ...
UVa 10112 - Myacm Triangles
UVa第一卷最后一题. 求内部不含点并且面积最大的三角形. 暴力. 代码如下: 1 #include<iostream> 2 #include<cstdio> 3 #inclu ...
UVa 10180 - Rope Crisis in Ropeland!
题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=41&pa ...
Uva 10074【递推dp】
UVa 10074 题意:求01矩阵的最大子0矩阵. http://www.csie.ntnu.edu.tw/~u91029/MaximumSubarray.html#2 这里说的很清楚.先求Larg ...

UVa 10697 - Firemen barracks

UVa 10697 - Firemen barracks相关推荐

最新文章

热门文章