HDU 4709 Herding

原创 2015年07月09日 17:51:40

Herding

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2037    Accepted Submission(s): 580


Problem 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
2.00
 

Source
 

题意:

一些点,求最小围成的不为零的面积。

代码:

#include <cstdio>
#include <cmath>
#include <iostream>
#include <cstring>
using namespace std;

struct tree
{
    double x, y;
} T[110];
double area(double x0, double y0, double x1, double y1, double x2, double y2)
{
    return fabs(x0 * y1 + x1 * y2 + x2 * y0 - x1 * y0 - x2 * y1 - x0 * y2) / 2;
}
int main()
{
    int t, n;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d", &n);
        for(int i = 0; i < n; i++) scanf("%lf%lf", &T[i].x, &T[i].y);
        double Dmax = 999999999.0;
        for(int i = 0; i < n; i++)      //枚举求最小面积
        {
            for(int j = i + 1; j < n; j++)
            {
                for(int k = j + 1; k < n; k++)
                {
                    double Area = area(T[i].x, T[i].y, T[j].x, T[j].y, T[k].x, T[k].y);
                    if(Area) Dmax = min(Dmax, Area);    //将面积为0的舍去
                }
            }
        }
        if(Dmax != 999999999.0) printf("%.2lf\n", Dmax);
        else printf("Impossible\n");
    }
    return 0;
}

附:用海伦公式水了一发,WA,可能是精度问题。如有大神有正解,望不吝赐教!




版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU 4709 Herding(叉乘法)

Herding Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Su...

HDU 4709 Herding(叉积求三角形面积)

Herding Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u ...

hdu 4709 Herding

题目: A - Herding Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Subm...

HDU 4709 Herding(求三角形面积)

Description Little John is herding his father's cattles. As a lazy boy, he cannot tolerate chasing ...

[ACM]hdu Herding(枚举+三角形面积)

解题思路: 本题就是给定几个点,然后从中选择几个点围成一定的面积,要求这个最小的面积,一开始想复杂了,以为四个或五个的点也能组成最小面积,其实最小的是三个点,因为四个或五个点其中里面选三个点肯定面积要...

hdu4709

Herding Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total...

hdu 4709

http://acm.hdu.edu.cn/showproblem.php?pid=4709 分析:此题比较简单,但是却因为初始化位置不对而WA了无数次……            此题中说有n棵树...

HDU 4709 三循环暴力

Herding Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Description ...

HDU4709 聚集(求三角形面积)

HDU4709 聚集(求三角形面积) 平面上给出N(1 输入:T(1 输出:输出找到的最小面积值(保留小数点后两位),如果最小面积值是0.00,则输出“Impossible” 分析:本题只需枚举所有的...

hdu 4709 叉乘计算

Herding Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 4709 Herding
举报原因:
原因补充:

(最多只允许输入30个字)