1006 of search
来源:互联网 发布:未成年犯罪知乎 编辑:程序博客网 时间:2024/06/06 18:48
Line belt
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 50 Accepted Submission(s) : 13
Problem Description
In a two-dimensional plane there are two line belts, there are two segments AB and CD, lxhgww's speed on AB is P and on CD is Q, he can move with the speed R on other area on the plane.<br>How long must he take to travel from A to D?
Input
The first line is the case number T.<br>For each case, there are three lines.<br>The first line, four integers, the coordinates of A and B: Ax Ay Bx By.<br>The second line , four integers, the coordinates of C and D:Cx Cy Dx Dy.<br>The third line, three integers, P Q R.<br>0<= Ax,Ay,Bx,By,Cx,Cy,Dx,Dy<=1000<br>1<=P,Q,R<=10
Output
The minimum time to travel from A to D, round to two decimals.
Sample Input
1<br>0 0 0 100<br>100 0 100 100<br>2 2 1
Sample Output
136.60
Author
lxhgww&&momodi
Source
HDOJ Monthly Contest – 2010.05.01
题目大意:给你两条传送带的坐标和其上面的速度,还有传送带外的速度,求出物体从一条传送带起点到另一条重点的最短时间。
题目思路:1这是这个专题里三分的最难的题了,因为用了两次三分,每次在起始传送带上固定一点用三分找到最小时间,在继续三分找到这些最短时间中时间最少的。
2由于起那几道题都可以用数学解决,这道我也试着用数学进行推倒,可惜水平有限,只是写出了满足的表达式,需要用到高维的线性规划知识,但目前并不知道怎么解。。。。
#include <iostream>#include <stdio.h>#include <math.h>using namespace std; struct point{ double x,y;};int p,q,r,v;double dis(point a,point b){ return pow(pow(a.y-b.y,2)+pow(a.x-b.x,2),1.0/2);}double findy(point c,point d,point y){ point mid,midmid,left,right; double t1,t2; left = c; right = d; do { mid.x = (left.x+right.x)/2; mid.y = (left.y+right.y)/2; midmid.x = (right.x+mid.x)/2; midmid.y = (right.y+mid.y)/2; t1 = dis(d,mid)/q+dis(mid,y)/r; t2 = dis(d,midmid)/q+dis(midmid,y)/r; if(t1>t2) left = mid; else right = midmid; }while(fabs(t1-t2)>0.000001); return t1;}double find(point a,point b,point c,point d){ point mid,midmid,left,right; double t1,t2; left = a; right = b; do { mid.x = (left.x+right.x)/2; mid.y = (left.y+right.y)/2; midmid.x = (right.x+mid.x)/2; midmid.y = (right.y+mid.y)/2; t1 = dis(a,mid)/p+findy(c,d,mid); t2 = dis(a,midmid)/p+findy(c,d,midmid); if(t1>t2)left = mid; else right = midmid; }while(fabs(t1-t2)>0.000001); return t1;}int main(){ int t; point a,b,c,d; scanf("%d",&t); while(t--) { scanf("%lf%lf%lf%lf %lf%lf%lf%lf",&a.x,&a.y,&b.x,&b.y,&c.x,&c.y,&d.x,&d.y); scanf("%d%d%d",&p,&q,&r); printf("%.2f\n",find(a,b,c,d)); } return 0;}
0 0
- 1006 of search
- 1003 of search
- 1004 of search
- 1005 of search
- 1007 of search
- 1008 of search
- 1009 of search
- 1010 of search
- 1011 of search
- 1012 of search
- 1003 of search
- 1015 of search
- 1016 of search
- 1018 of search
- 1019 of search
- 1020 of search
- the summary of search
- Role of Internal Search
- insert all
- (原创)关于PopupWindow的showAsDropDown()和showAtLocation()使用方式及其区别
- 敏捷开发中个一些概念及要点
- SM2算法第二篇:“七问”SM2椭圆曲线公钥密码算法
- POST请求操作时所遇到的问题汇总
- 1006 of search
- cuda 6.5升级到cuda7.5方法
- 实习总结03
- zs
- Android OpenGL 开始篇 <1>
- 鲁大师劫持浏览器主页,千万不要装
- 十八、图算法之最短路径
- 蓝桥杯 机器人行走
- Java获取指定文件夹内的全部文件名称