Tornado

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

Problem Description
Professor Jonathan is a well-known Canadian physicist and meteorologist. People who know him well call him “Wind Chaser”. It is not only because of his outstanding tornado research which is the most influential in the academic community, but also because of his courageous act in collecting real data of tornados. Actually he has been leading his team chasing tornado by cars equipped with advanced instruments hundreds of times.

In summer, tornado often occurs in the place where Professor Jonathan lives. After several years of research, Wind Chaser found many formation rules and moving patterns of tornados. In the satellite image, a tornado is a circle with radius of several meters to several kilometers. And its center moves between two locations in a straight line, back and forth at a fixed speed. After observing a tornado’s movement, Wind Chaser will pick a highway, which is also a straight line, and chase the tornado along the highway at the maximum speed of his car.

The smallest distance between the Wind Chaser and the center of the tornado during the whole wind chasing process, is called “observation distance”. Observation distance is critical for the research activity. If it is too short, Wind Chaser may get killed; and if it is too far, Wind Chaser can’t observe the tornado well. After many times of risk on lives and upset miss, Wind Chaser turns to you, one of his most brilliant students, for help. The only thing he wants to know is the forthcoming wind chasing will be dangerous, successful or just a miss.

 
Input
Input contains multiple test cases. Each test case consists of three lines which are in the following format.

xw1 yw1 xw2 yw2 vw
xt1 yt1 xt2 yt2 vt
dl du

In the first line, (xw1, yw1) means the start position of Wind Chaser; (xw2, yw2) is another position in the highway which Wind Chaser will definitely pass through; and vw is the speed of the car. Wind chaser will drive to the end of the world along that infinite long highway.
In the second line, (xt1, yt1) is the start position of tornado; (xt2, yt2) is the turn-around position and vt is the tornado’s speed. In other words, the tornado’s center moves back and forth between (xt1, yt1) and (xt2, yt2) at speed vt .

The third line shows that if the observation distance is smaller than dl , it will be very dangerous; and if the observation distance is larger than du, it will be a miss; otherwise it will lead to a perfect observation.

All numbers in the input are floating numbers.

-2000000000 <= xw1, yw1, xw2, yw2, xt1, yt1, xt2, yt2 <= 2000000000
1 <= vw, vt <= 20000
0 <= dl, du <= 2000000

Note:
1.  It’s guaranteed that the observation distance won’t be very close to dl or du during the whole wind chasing process. There will be at least 10-5 of difference. 
2.  Wind Chaser and the tornado start to move at the same time from their start position.

 
Output
For each test case output one line contains one word “Dangerous”, “Perfect” or “Miss” which describes the prediction of the observation.
 
Sample Input
0 0 1 0 2
10 -5 12 7 4
1.3 2.7
0 0 1 0 2
10 -5 12 7 1
0.3 0.4
 
Sample Output
Dangerous
Perfect
 
Source
 
Recommend
gaojie   |   We have carefully selected several similar problems for you:  2490 2494 3254 2267 1755 
 

代码:

 #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
const int MAX= ;
const double esp = 1e-; struct Tnode
{
double x,y;
}w1,w2,t1,t2;
double vw,vt,dl,du;
double getmin(double a , double b)
{
return (a>b)?b:a;
}
//求点积
double dianji(Tnode &a ,Tnode &b ,Tnode &c)
{
return (b.x-a.x)*(c.x-a.x)+(b.y-a.y)*(c.y-a.y);
}
//求叉 积
double det(Tnode &a ,Tnode &b ,Tnode &c)
{
return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y);
}
//求距离
double dis(Tnode &a,Tnode &b)
{
return sqrt(fabs((b.x-a.x)*(b.x-a.x)+(b.y-a.y)*(b.y-a.y)));
}
//求点o到线段的最近的距离
double getdistance(Tnode &o,Tnode a ,Tnode b,double dx,double dy)
{
a.x+=dx;
a.y+=dy;
b.x+=dx;
b.y+=dy;
double d =getmin(dis(o,a),dis(o,b));
double di=dis(a,b);
if(di<=esp) return dis(o,a);
if(dianji(a,o,b)>=-esp&&dianji(b,o,a)>=-esp)
return fabs(det(a,b,o))/di;
else
return getmin(dis(o,a),dis(o,b));
}
//求o到以线段ab为起始,(dx,dy)为间距的平行线段的最近距离
double calc(Tnode &o ,Tnode &a ,Tnode &b , double dx, double dy)
{
Tnode a1,b1;
int ll=,rr=MAX;
while(ll<rr)
{
int mid=(ll+rr)/;
double d1=getdistance(o,a,b,dx*mid,dy*mid);
double d2=getdistance(o,a,b,dx*(mid+),dy*(mid+));
if(d1<=d2+esp) rr=mid;
else ll=mid+;
}
return getdistance(o,a,b,dx*ll,dy*ll);
}
void work()
{
Tnode wdr ,tdr,move,a1,b1,a2,b2;
double distance,time,d,d1,d2;
distance=dis(w1,w2);
wdr.x = (w2.x-w1.x)*vw/distance;
wdr.y = (w2.y-w1.y)*vw/distance;
distance = dis(t1,t2);
time = distance/vt;
tdr.x = (t2.x-t1.x)*vt/distance;
tdr.y=(t2.y-t1.y)*vt/distance;
move.x=(-wdr.x+tdr.x)*time;
move.y=(-wdr.y+tdr.y)*time;
//求两个线段簇的第一条线段a1-b1和a2-b2
a1=t1;
b1.x=a1.x+move.x;
b1.y=a1.y+move.y;
move.x=(-wdr.x-tdr.x)*time;
move.y=(-wdr.y-tdr.y)*time;
a2=b1;
b2.x=a2.x+move.x;
b2.y=a2.y+move.y;
//分别求点w1到两个线段簇的最近距离d1和d3
d1=calc(w1,a1,b1,b2.x-a1.x,b2.y-a1.y);
d2=calc(w1,a2,b2,b2.x-a1.x,b2.y-a1.y);
//判断结果
d=getmin(d1,d2);
if(d+esp<d1) printf("Dangerous\n");
else if(d-esp>du) printf("Miss\n");
else printf("Perfect\n");
}
int main()
{
while(scanf("%lf",&w1.x)!=EOF)
{
scanf("%lf%lf%lf%lf",&w1.y,&w2.x,&w2.y,&vw);
scanf("%lf%lf%lf%lf%lf",&t1.x,&t1.y,&t2.x,&t2.y,&vt);
scanf("%lf%lf",&dl,&du);
work();
}
return ;
}

hdu------2488Tornado(几何)的更多相关文章

  1. hdu 5430(几何)

    题意:求光在圆内反射n次后第一次返回原点的方案数 如果k和n-1可约分,则表明是循环多次反射方案才返回原点. #include <iostream> #include <cstrin ...

  2. hdu 1577 WisKey的眼神 (数学几何)

    WisKey的眼神 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total S ...

  3. POJ 3831 &amp; HDU 3264 Open-air shopping malls(几何)

    题目链接: POJ:id=3831" target="_blank">http://poj.org/problem?id=3831 HDU:http://acm.h ...

  4. HDU 1700 Points on Cycle (几何 向量旋转)

    http://acm.hdu.edu.cn/showproblem.php?pid=1700 题目大意: 二维平面,一个圆的圆心在原点上.给定圆上的一点A,求另外两点B,C,B.C在圆上,并且三角形A ...

  5. HDU 1432 Lining Up(几何)

    http://acm.hdu.edu.cn/showproblem.php?pid=1432 题目大意: 2维平面上给定n个点,求一条直线能够穿过点数最多是多少. 解题思路: 因为题目给定的n(1~7 ...

  6. HDU 1392 Surround the Trees(几何 凸包模板)

    http://acm.hdu.edu.cn/showproblem.php?pid=1392 题目大意: 二维平面给定n个点,用一条最短的绳子将所有的点都围在里面,求绳子的长度. 解题思路: 凸包的模 ...

  7. hdu 5839(三维几何)

    Special Tetrahedron Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Othe ...

  8. hdu 1115 Lifting the Stone (数学几何)

    Lifting the Stone Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others ...

  9. hdu 1086 You can Solve a Geometry Problem too (几何)

    You can Solve a Geometry Problem too Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/3 ...

  10. HDU 5128.The E-pang Palace-计算几何

    The E-pang Palace Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Othe ...

随机推荐

  1. winform继承窗体,无法修改父窗体控件问题处理笔记

    问题描述: 一个窗体集成父窗体,发现无法直接修改父窗体的控件,比如修改大小等,父窗体控件已经设置为public,如果做成一个dll被引用无此问题 特征: 不禁使父窗体控件,就算新加一个控件也会这样:鼠 ...

  2. DevExpress中使用DocumentManager,并确保不重复

    https://www.devexpress.com/Support/Center/Question/Details/Q411356 void ActivatForm(Type someType) { ...

  3. MyBatis Mapper 接口如何通过JDK动态代理来包装SqlSession 源码分析

    我们以往使用ibatis或者mybatis 都是以这种方式调用XML当中定义的CRUD标签来执行SQL 比如这样 <?xml version="1.0" encoding=& ...

  4. 自定义类型转换器converter

    作用:目前将日期转换成string,将string转换成我想要的类型   0509课件里讲 一.数据类型转换在web应用程序中,数据存在两个方向上的转换:1.当提交表单时  表单数据以字符串的形式提交 ...

  5. C# 获取打印机列表以及串口

    C# 获取打印机列表以及默认打印机.串口列表. /// <summary> /// 获取本地已安装的打印机 /// </summary> /// <returns> ...

  6. CUBRID学习笔记 11 数据类型之日期

    datetime 虽然和mysql很相像,但是日期类型和mysql是不一样的.和sqlserver差不多. 如YYYY-MM-DD hh:mi:ss.fff or mm/dd/yyyy hh:mi:s ...

  7. django(一)搭建开发环境

    本学习系列均使用centos7操作系统,基于python3进行操作.centos7下的python3安装配置http://www.cnblogs.com/Guido-admirers/p/625941 ...

  8. .NET中的三种接口实现方式

    摘自:http://www.cnblogs.com/zhangronghua/archive/2009/11/25/1610713.html 一般来说.NET提供了三种不同的接口实现方式,分别为隐式接 ...

  9. json、javaBean、xml互转的几种工具介绍 (转载)

    工作中经常要用到Json.JavaBean.Xml之间的相互转换,用到了很多种方式,这里做下总结,以供参考. 现在主流的转换工具有json-lib.jackson.fastjson等,我为大家一一做简 ...

  10. TreeView控件

    public partial class WebForm1 : System.Web.UI.Page { DataSet dsTreeView = new DataSet(); protected v ...