SDAU课程练习2 1004

Toxophily

Time Limit : 3000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 23   Accepted Submission(s) : 9

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.<br>We all like toxophily.<br><br>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?<br><br>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. <br>

 

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.<br>Technical Specification<br><br>1. T ≤ 100.<br>2. 0 ≤ x, y, v ≤ 10000. <br>

 

Output

For each test case, output the smallest answer rounded to six fractional digits on a separated line.<br>Output "-1", if there's no possible answer.<br><br>Please use radian as unit. <br>

 

Sample Input

  
  

   
   3<br>0.222018 23.901887 121.909183<br>39.096669 110.210922 20.270030<br>138.355025 2028.716904 25.079551<br>
  
  

 

Sample Output

  
  

   
   1.561582<br>-1<br>-1<br>
  
  

 

Source

The 4th Baidu Cup final

 

题目大意：

给出 一个点 x ，y 坐标，给出初速度。求从坐标原点以什么角度斜上抛运动可以达到那个点。

思路：

首先运用物理知识，写出运动轨迹方程，然后就可以  代入所给点，判断此点位置，也就是二分求角度。

或者可以把上式再转化一下，变成一个一元二次方程，讨论解的个数即可。

感想：

当时的草稿纸木见了（没有了。。。）  所以公式就不在这里写出来了，其实，看看下面的代码，公式都在代码中。

AC代码：

#include <cstdio>
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<numeric>
#include<math.h>
#include<string.h>
#include<map>
#include<set>
#include<vector>
#include<iomanip>
using namespace std;
double PI=acos(-1.0);
int main()
{
   // freopen("r.txt","r",stdin);
    double x,y,v,a,b,c,t,x1,x2;
    int N;
    cin>>N;
    while(N--)
    {
        cin>>x>>y>>v;
        if(x==0&&y==0) cout<<0<<endl;
        else
        {
            a=x*x*(9.8/(2*v*v));
            b=-1*x;
            c=y+a;
            t=b*b-4*a*c;
            if(t<0) cout<<-1<<endl;
            else
            {
                x1=(-1*b-sqrt(t))/(2*a);
                x2=(-1*b+sqrt(t))/(2*a);
                if(x1>=0)
                {
                    if(x2>=0)
                        x1=min(x1,x2);
                    printf("%.6f\n",atan(x1));
                }
                else if(x2>=0) printf("%.6f\n",atan(x2));
                else
                    cout<<-1<<endl;

            }
        }
    }
    return 0;


}