Toxophily
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2697 Accepted Submission(s): 1512
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
- T ≤ 100.
- 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
题目大意:以Bob为起始点进行射击,给一个射击目标的坐标(用x,y表示),和初速度v。若能射中目标,求Bob射击时速度与x轴的夹角的最小值(角度用弧度表示),否则输出-1。
分析:以Bob为坐标原点进行斜上抛运动(运用简单的物理知识,分解成x,y方向),把角度在0到PI/2进行二分,看是否能到达射击目标。
公式:t=x/(v*cos(angle)), y=v*sin(angle)*t-g*t*t/2
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
const double PI=acos(-1.0);
const double g=9.8;
double x,y,v;
double F(double angle)
{
double t=x/(v*cos(angle));
return v*sin(angle)*t-g*t*t/2-y;
}
int main()
{
int t;
cin>>t;
while(t--)
{
cin>>x>>y>>v;
double l=0,r=PI/2,m;
while(r-l>1e-8)
{
m=(l+r)/2;
if(F(m)>0)
r=m;
else
l=m;
}
if(F(r)<0||F(l)>0)
{
printf("-1\n");
continue;
}
printf("%.6f\n",m);
}
}