hdu4717 The Moving Points 三分求函数最小值
来源:互联网 发布:马来西亚海关数据 编辑:程序博客网 时间:2024/06/08 23:55
The Moving Points
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1754 Accepted Submission(s): 696
Problem Description
There are N points in total. Every point moves in certain direction and certain speed. We want to know at what time that the largest distance between any two points would be minimum. And also, we require you to calculate that minimum distance. We guarantee that no two points will move in exactly same speed and direction.
Input
The rst line has a number T (T <= 10) , indicating the number of test cases.
For each test case, first line has a single number N (N <= 300), which is the number of points.
For next N lines, each come with four integers Xi, Yi, VXi and VYi (-106 <= Xi, Yi <= 106, -102 <= VXi , VYi <= 102), (Xi, Yi) is the position of the ith point, and (VXi , VYi) is its speed with direction. That is to say, after 1 second, this point will move to (Xi + VXi , Yi + VYi).
For each test case, first line has a single number N (N <= 300), which is the number of points.
For next N lines, each come with four integers Xi, Yi, VXi and VYi (-106 <= Xi, Yi <= 106, -102 <= VXi , VYi <= 102), (Xi, Yi) is the position of the ith point, and (VXi , VYi) is its speed with direction. That is to say, after 1 second, this point will move to (Xi + VXi , Yi + VYi).
Output
For test case X, output "Case #X: " first, then output two numbers, rounded to 0.01, as the answer of time and distance.
Sample Input
220 0 1 02 0 -1 020 0 1 02 1 -1 0
Sample Output
Case #1: 1.00 0.00Case #2: 1.00 1.00
将任意两点的距离公式写出来是一个开口向上的抛物线,然后所有的子函数都是一个开口向上的抛物线,他们取max肯定也是先减后增的,然后
就用三分法逐步逼近最低点就行,100次计算就完全可以满足精度要求了
#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;const int maxn = 300 + 10;int T, N;struct point {int x, y, vx, vy;}p[maxn];double MAX(double a, double b) {return a > b ? a : b;}double calc(double tm) {double ans = 0;for (int i = 0; i < N - 1; i++) {point a = p[i];for (int j = i + 1; j < N; j++) {point b = p[j];double X = (a.x - b.x) + tm * (a.vx - b.vx);double Y = (a.y - b.y) + tm * (a.vy - b.vy);ans = MAX(ans, X * X + Y * Y);}}return ans;}double getTime() {double l = 0.0, r = 1e6, mid, mmid;for (int i = 1; i <= 100; i++) {mid = (l + r) / 2;mmid = (mid + r) / 2;calc(mid) < calc(mmid) ? r = mmid : l = mid;}return mid;}int main(){scanf("%d", &T);for (int t = 1; t <= T; t++) {scanf("%d", &N);for (int i = 0; i < N; i++) {scanf("%d%d%d%d", &p[i].x, &p[i].y, &p[i].vx, &p[i].vy);}double tm = getTime();printf("Case #%d: %.2f %.2f\n", t, tm, sqrt(calc(tm)));}return 0;}
0 0
- hdu4717 The Moving Points 三分求函数最小值
- hdu4717 The Moving Points 三分
- HDU4717 The Moving Points(三分)
- hdu4717 The Moving Points
- HDU4717-The Moving Points
- hdu4717-(The Moving Points)
- 【hdu4717】The Moving Points
- HDU4717 :The Moving Points(三分法)
- hdu4717 The Moving Points(二分做法)
- HDU 4717 The Moving Points(三分枚举)
- HDOJ 4747 - The Moving Points 三分搜索...
- hdu 4717 - The Moving Points(三分)
- hdu 4717 The Moving Points(三分)
- HDU 4717 The Moving Points(三分)
- hdu 4717 The Moving Points(三分)
- The Moving Points -HDU 4717 三分
- hdu 4717 The Moving Points(三分)
- HDU 4717 The Moving Points (三分)
- 字符串之一:匹配相关
- 64. Minimum Path Sum
- 设计模式笔记
- (OK) install vmware12 in fedora23
- SPOJ 8222 NSUBSTR 后缀自动机
- hdu4717 The Moving Points 三分求函数最小值
- HTML5第六次培训(AJAX基础-http协议)
- Android传感器使用大全
- ajax在jquery中的应用
- C语言位操做符代码演示
- POJ 2187 Beauty Contest
- 我眼中的自动化测试框架设计要点-要让QA不必去写代码
- 《Java程序设计基础》 第8章手记Part 2
- Servlet过滤器