hdu 2298 Toxophily

2017-11-14 1112

版权

本文内容由阿里云实名注册用户自发贡献，版权归原作者所有，阿里云开发者社区不拥有其著作权，亦不承担相应法律责任。具体规则请查看《阿里云开发者社区用户服务协议》和《阿里云开发者社区知识产权保护指引》。如果您发现本社区中有涉嫌抄袭的内容，填写侵权投诉表单进行举报，一经查实，本社区将立刻删除涉嫌侵权内容。

简介：

Toxophily

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 99 Accepted Submission(s): 56

Problem Description

The recreation center of WHU ACM Team has indoor billiards, Ping Pang, chess and bridge, toxophily, deluxe ballrooms KTV rooms, fishing, climbing, and so on.
We all like toxophily.

Bob is hooked on toxophily recently. Assume that Bob is at point (0,0) and he wants to shoot the fruits on a nearby tree. He can adjust the angle to fix the trajectory. Unfortunately, he always fails at that. Can you help him?

Now given the object's coordinates, please calculate the angle between the arrow and x-axis at Bob's point. Assume that g=9.8N/m.

Input

The input consists of several test cases. The first line of input consists of an integer T, indicating the number of test cases. Each test case is on a separated line, and it consists three floating point numbers: x, y, v. x and y indicate the coordinate of the fruit. v is the arrow's exit speed.
Technical Specification

1. T ≤ 100.
2. 0 ≤ x, y, v ≤ 10000.

Output

For each test case, output the smallest answer rounded to six fractional digits on a separated line.
Output "-1", if there's no possible answer.

Please use radian as unit.

Sample Input

3
0.222018 23.901887 121.909183
39.096669 110.210922 20.270030
138.355025 2028.716904 25.079551

Sample Output

1.561582
-1
-1

分析：

网上这道题的解法几乎都是2分法效率还可以，但是用数学方法解题可以实现0ms通过。

用公式，根据正交分解坐标系，得出方程的通式。

想 x^2*g/(2*v^2)*tan^2(ß) - x*tan(ß) +y + x^2*g/(2*v^2) = 0;

即：a = g*pow(x,2)/(2*pow(v,2));

b = -x;

c = y + g*pow(x,2)/(2*pow(v,2));

根据求根公式求出根。

注意讨论：

（1） x==0&&y==0时，ß = 0；

（2） x==0&&y>0时，ß=90；

（3）方程无解时 ß=-1；

（4）方程的解为负数时，ß=-1；（0<=ß<=90）。

#include <iostream>

#include <stdio.h>

#include <math.h>
using namespace std;
int main()

{
int t;
double a,b,c,angle,z;
double x,y,v,g = 9.8,T,ans1,ans2;

scanf("%d",&t);
while(t--)

{

scanf("%lf%lf%lf",&x,&y,&v);
if(x==0&&y==0)

printf("0\n");
else if(x==0&&y>0)

printf("90\n");
else

{

a = g*pow(x,2)/(2*pow(v,2));

b = -x;

c = y+a;

T = pow(b,2) - 4*a*c;

angle = 0;
if(T<0)

printf("-1\n");
else

{

ans1 = ((-b)+pow(T,1.0/2))/(2*a);

ans2 = ((-b)-pow(T,1.0/2))/(2*a);
if(ans1>=0) angle = atan(ans1);
if(ans2>=0)

{

z =  atan(ans2);
if(z<angle) angle = z;

printf("%.6f\n",angle);

}
if(ans1<0&&ans2<0)

printf("-1\n");

}

}

}
return 0;

}

本文转自NewPanderKing51CTO博客，原文链接： http://www.cnblogs.com/newpanderking/archive/2011/08/25/2153590.html ，如需转载请自行联系原作者

文章标签：

Java

hdu 2298 Toxophily

Toxophily

热门文章

最新文章

相关电子书