HDU 5761_2016 Multi-University Training Contest 3
来源:互联网 发布:linux高级运维 编辑:程序博客网 时间:2024/06/08 08:19
Rower Bo
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 659 Accepted Submission(s): 210
Special Judge
Problem Description
There is a river on the Cartesian coordinate system,the river is flowing along the x-axis direction.
Rower Bo is placed at (0,a) at first.He wants to get to origin (0,0) by boat.Boat speed relative to water is v1,and the speed of the water flow is v2.He will adjust the direction of v1 to origin all the time.
Your task is to calculate how much time he will use to get to origin.Your answer should be rounded to four decimal places.
If he can’t arrive origin anyway,print”Infinity”(without quotation marks).
Input
There are several test cases. (no more than 1000)
For each test case,there is only one line containing three integers a,v1,v2.
0≤a≤100, 0≤v1,v2,≤100, a,v1,v2 are integers
Output
For each test case,print a string or a real number.
If the absolute error between your answer and the standard answer is no more than 10−4, your solution will be accepted.
Sample Input
2 3 3
2 4 3
Sample Output
Infinity
1.1428571429
Source
2016 Multi-University Training Contest 3
真的不说什么了,比赛时想到了微分,结果运动的情况想复杂了。……
其实就是v1始终指向(0,0)点,之后 设船到原点的距离为r,那么 r对t积分可以得到v2*cos@
(@为v1与原点连接之后与X轴的夹角) 接着说 (v1-v2*cos@)对时间T积分,上限T,下限0
沿x轴上下限均是0,v1*cous@-v2 对T积分,上限T,下限0。之后把第二个式子里的积分用等式换为以v1和v2的形式表达。那么 我们就可以得到结果
#include <stdio.h>#include <iostream>#include <algorithm>using namespace std;int main(){ int a,v1,v2; while(~scanf("%d %d %d",&a,&v1,&v2)) { if(a==0) { printf("0\n"); continue; } else{ if(v1<=v2) { printf("Infinity\n"); continue; } else { double T=(a*v1*1.0)/(1.0*(v1*v1-v2*v2)); printf("%lf\n",T); } } } return 0;}
- HDU 5761_2016 Multi-University Training Contest 3
- hdu 5316 Magician(2015 Multi-University Training Contest 3)
- HDU 5316 Magician(2015 Multi-University Training Contest 3 1001)
- hdu 5317 RGCDQ 2015 Multi-University Training Contest 3
- hdu 5319 Painter 2015 Multi-University Training Contest 3
- hdu-5316 Magician (2015 Multi-University Training Contest 3)
- hdu-5325 Crazy Bobo (2015 Multi-University Training Contest 3)
- hdu 5316 Magician 2015 Multi-University Training Contest 3
- hdu 5326 Work 2015 Multi-University Training Contest 3
- hdu 5319 Painter 2015 Multi-University Training Contest 3
- hdu 5317 RGCDQ 2015 Multi-University Training Contest 3
- hdu 5316 Magician 2015 Multi-University Training Contest 3
- HDU 3068 2017 Multi-University Training Contest
- HDU 6034 & 2017 Multi-University Training Contest
- hdu 6034 2017 Multi-University Training Contest
- HDU 3065 2017 Multi-University Training Contest
- HDU 6047 2017 Multi-University Training Contest
- HDU 6052 2017 Multi-University Training Contest
- geekband android #5 第六周分享(SQL、Content Provider)
- FTP-Android客户端实现笔记
- CProxyDllMaker : a class to make proxy dll's masm source code
- Design Tic-Tac-Toe
- PKU四日游(信息科学夏令营)
- HDU 5761_2016 Multi-University Training Contest 3
- Leetcode Sum of Two Integers
- Leetcode Minimum Depth of Binary Tree
- Leetcode Word Ladder II
- Leetcode Binary Tree Preorder Traversal
- Leetcode Convert Sorted Array to Binary Search Tree
- Leetcode Missing Number
- Leetcode Fraction to Recurring Decimal
- Leetcode Rotate List