HDU 4709 Herding(求三角形面积)
来源:互联网 发布:ubuntu更改语言 编辑:程序博客网 时间:2024/05/28 23:12
Description
Little John is herding his father's cattles. As a lazy boy, he cannot tolerate chasing the cattles all the time to avoid unnecessary omission. Luckily, he notice that there were N trees in the meadow numbered from 1 to N, and calculated their cartesian coordinates (Xi, Yi). To herding his cattles safely, the easiest way is to connect some of the trees (with different numbers, of course) with fences, and the close region they formed would be herding area. Little John wants the area of this region to be as small as possible, and it could not be zero, of course.
Input
The first line contains the number of test cases T( T<=25 ). Following lines are the scenarios of each test case.
The first line of each test case contains one integer N( 1<=N<=100 ). The following N lines describe the coordinates of the trees. Each of these lines will contain two float numbers Xi and Yi( -1000<=Xi, Yi<=1000 ) representing the coordinates of the corresponding tree. The coordinates of the trees will not coincide with each other.
Output
For each test case, please output one number rounded to 2 digits after the decimal point representing the area of the smallest region. Or output "Impossible"(without quotations), if it do not exists such a region.
Sample Input
1
4
-1.00 0.00
0.00 -3.00
2.00 0.00
2.00 2.00
Sample Output
Little John is herding his father's cattles. As a lazy boy, he cannot tolerate chasing the cattles all the time to avoid unnecessary omission. Luckily, he notice that there were N trees in the meadow numbered from 1 to N, and calculated their cartesian coordinates (Xi, Yi). To herding his cattles safely, the easiest way is to connect some of the trees (with different numbers, of course) with fences, and the close region they formed would be herding area. Little John wants the area of this region to be as small as possible, and it could not be zero, of course.
Input
The first line contains the number of test cases T( T<=25 ). Following lines are the scenarios of each test case.
The first line of each test case contains one integer N( 1<=N<=100 ). The following N lines describe the coordinates of the trees. Each of these lines will contain two float numbers Xi and Yi( -1000<=Xi, Yi<=1000 ) representing the coordinates of the corresponding tree. The coordinates of the trees will not coincide with each other.
Output
For each test case, please output one number rounded to 2 digits after the decimal point representing the area of the smallest region. Or output "Impossible"(without quotations), if it do not exists such a region.
Sample Input
1
4
-1.00 0.00
0.00 -3.00
2.00 0.00
2.00 2.00
Sample Output
2.00
题意求给定点中最小三角形的面积,如果不存在输出Impossible。
#include<cstdio>#include<cmath>using namespace std;struct point{ double x,y;} a[105];double cross(point p1,point p2,point p3){ return ((p2.x-p1.x)*(p3.y-p1.y)-(p2.y-p1.y)*(p3.x-p1.x))/2.0;}int main(){ int t,i,j,k,n,flag; scanf("%d",&t); while(t--) { double minn=1e20; flag=0; scanf("%d",&n); for(i=0; i<n; i++) { scanf("%lf%lf",&a[i].x,&a[i].y); } for(i=0; i<n; i++) for(j=i+1; j<n; j++) for(k=j+1; k<n; k++) if(fabs(cross(a[i],a[j],a[k]))<1e-10) continue; else if(fabs(cross(a[i],a[j],a[k]))<minn) minn=fabs(cross(a[i],a[j],a[k])); if(minn==1e20) printf("Impossible\n"); else printf("%.2lf\n",minn); }}
0 0
- HDU 4709 Herding(求三角形面积)
- HDU 4709 Herding(叉积求三角形面积)
- hdu 4709 - Herding【计算几何-三角形面积】
- [ACM]hdu Herding(枚举+三角形面积)
- Herding(hdu4709)三点运用行列式求面积
- hdu4709 herding 计算几何 三角形面积 枚举
- hdu 5979 Convex(正弦定理求三角形面积)
- AYIT2016省赛集训第五周 A - Herding(三角形面积)
- HDU 4709 Herding(热身赛第四题)
- HDU 4709 Herding(叉乘法)
- hdu 4709 Herding
- hdu 4709 Herding acm
- hdu - 4709 - Herding
- HDU 4709 Herding
- hdu 4709 Herding
- HDU 4709 Herding
- HDU 4709 Herding
- HDU - 4709 Herding
- 一个Filter配置多个url-pattern
- APNS发消息的原理
- EasyCharts,简单易用的Excel图表插件
- C语言简介+helloworld
- 1017 of dp
- HDU 4709 Herding(求三角形面积)
- 开发IOS推送功能客户端需要做的事情
- Invert Binary (recursive and iterative)
- method_exchangeImplementations方法互换
- 获取当前系统版本
- 如何以“正确的姿势”阅读开源软件代码
- 获取section下的子控件
- 根据segue跳转
- url转成字符串