hdu 4709 Herding acm
来源:互联网 发布:手机淘宝账户登录不上 编辑:程序博客网 时间:2024/05/16 09:32
Herding
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0
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
14-1.00 0.000.00 -3.002.00 0.002.00 2.00
Sample Output
2.00
#include <iostream>#include <cstdio>#include <cmath>using namespace std;#define MAXN 101#define INF 1e20#define eps 1e-8struct Node{ double x, y;}node[MAXN];double cal(int i, int j, int k){ return 0.5*(fabs((node[j].x - node[i].x) * (node[k].y - node[i].y) - (node[k].x - node[i].x) * (node[j].y - node[i].y)));}void input(){ int t, n; cin >> t; while (t--) { cin >> n; for (int i = 0; i < n; i++) { cin >> node[i].x >> node[i].y; } double area = INF; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { for (int k = 0; k < n; k++) { if(k == i || k == j) continue; double now = cal(i, j, k); if (area >= now && now > eps) { area = now; } } } } if (area < eps || n <= 2 || area >= INF) { cout << "Impossible" << endl; } else { printf("%.2lf\n", area); } }}int main(){ std::ios::sync_with_stdio(false); input(); return 0;}
- hdu 4709 Herding acm
- hdu 4709 Herding
- hdu - 4709 - Herding
- HDU 4709 Herding
- hdu 4709 Herding
- HDU 4709 Herding
- HDU 4709 Herding
- HDU - 4709 Herding
- HDU 4709 Herding
- hdu 4709 Herding (数学)
- HDU 4709 Herding
- HDU 4709 Herding
- HDU 4709 Herding
- hdu 4709 Herding
- HDU 4709:Herding
- HDU 4709 Herding
- hdu 4709 Herding
- hdu 4709 Herding
- memcpy的实现
- hdu 4707 pet acm
- jsp+servlet登陆实例演示
- 关于EINTR错误的理解
- dos界面下切换输入法的技巧
- hdu 4709 Herding acm
- 避免定义重复小技巧
- 【译】性能调优之后,进一步的验证和分析
- 浅析最长上升子序列问题
- 借力于专注:发现三年前的博文有感
- 递归浅析
- hdu 4715 Difference Between Primes acm
- 为什么构造函数没有调用?
- 测试金字塔