hdu 5761 Rowe Bo 微分方程-CSDN博客

1010 Rower Bo

首先这个题微分方程强解显然是可以的，但是可以发现如果设参比较巧妙就能得到很方便的做法。

先分解 $v_1v1，$

Alt text

设船到原点的距离是

$\frac{ dr}{ dt}=v_2\cos \theta-v_1dtdr=v2cosθ−v1$

$\frac{ dx}{ dt}=v_2-v_1\cos \thetadtdx=v2−v1cosθ$

上下界都是清晰的，定积分一下：

$0-a=v_2\int_0^T\cos\theta{ d}t-v_1T0−a=v2∫0Tcosθdt−v1T$

$0-0=v_2T-v_1\int_0^T\cos\theta{ d}t0−0=v2T−v1∫0Tcosθdt$

直接把第一个式子代到第二个里面

$v_2T=\frac{v_1}{v_2}(-a+v_1T)v2T=v2v1(−a+v1T)$

$T=\frac{v_1a}{{v_1}^2-{v_2}^2}T=v12−v22v1a$

这样就很Simple地解完了，到达不了的情况就是 $v_1< v_2v1<v2（或者a>0a>0且v_1=v_2v1=v2）。$

1011 Teacher Bo

考虑一种暴力,每次枚举两两点对之间的曼哈顿距离,并开一个桶记录每种距离是否出现过,如果某次枚举出现了以前出现的距离就输

注意到曼哈顿距离只有

一组数据的时间复杂度 $O(min{N2,M}) .$

Rower Bo

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 1248 Accepted Submission(s): 474
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

Input

There are several test cases. (no more than 1000)

For each test case,there is only one line containing three 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

Sample Input

2 3 3 2 4 3

Sample Output

Infinity 1.1428571429

Author

绍兴一中

#include<iostream>
#include<stdio.h>
#include<math.h>
using namespace std;
int main()
{
    int a,v1,v2;
    while(~scanf("%d%d%d",&a,&v1,&v2))
    {
        if(a==0) {printf("0.000\n");continue;}
        if(v1<=v2)
        {
            printf("Infinity\n");
        }
        else
        {
            double v=(v1*v1-v2*v2)+0.0;

            double ans=(a*v1*1.0)/v;
            printf("%.12lf\n",ans);
        }
    }
    return 0;
}