HDU-4709 herding

Source: Internet
Author: User

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 wocould be herding area. little John wants the area of this region to be as small as possible, and it cocould 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

 14-1.00 0.000.00 -3.002.00 0.002.00 2.00 

Sample output

 2.00 

Source

2013 ACM/ICPC Asia Regional Online-warmup

Idea: enumeration Calculation

#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>using namespace std;const int MAXN = 150;const double INF = 100000000.0;struct node {double x, y;} point[MAXN];int n;double dis(int a, int b) {return sqrt((point[a].x-point[b].x)*(point[a].x-point[b].x)+(point[a].y-point[b].y)*(point[a].y-point[b].y));}double cal(int a, int b, int c) {double A = dis(a, b);double B = dis(a, c);double C = dis(b, c);double p = (A+B+C)/2;return sqrt(p*(p-A)*(p-B)*(p-C));}int main() {int t;scanf("%d", &t);while (t--) {scanf("%d", &n);for (int i = 0; i < n; i++)scanf("%lf%lf", &point[i].x, &point[i].y);double ans = 1e20;int flag = 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 tmp = cal(i, j, k);if (fabs(tmp) >= 0.01) {flag = 1;ans = min(ans, tmp);}}if (!flag) printf("Impossible\n");else printf("%.2lf\n", ans);}}



Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.