2016多校联赛 hdu5826 physics 数学题

最新推荐文章于 2022-10-26 21:45:20 发布

原创最新推荐文章于 2022-10-26 21:45:20 发布 · 532 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#C++ #算法竞赛 #多校联赛

------------解题报告------------- 同时被 2 个专栏收录

208 篇文章

订阅专栏

-------数学／物理题-----

21 篇文章

订阅专栏

本文探讨了在平滑水平直轨上多个球体的运动和碰撞问题，使用了一种特殊的加速度与速度关系，通过积分求解球体在特定时间点的速度。介绍了如何忽略初始位置和方向的影响，并给出了具体的C++实现代码。

physics

Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 996 Accepted Submission(s): 524

Problem Description

There are n balls on a smooth horizontal straight track. The track can be considered to be a number line. The balls can be considered to be particles with the same mass.

At the beginning, ball i is at position Xi. It has an initial velocity of Vi and is moving in direction

Di.(Di∈−1,1)
Given a constant C. At any moment, ball its acceleration Ai and velocity Vi have the same direction, and magically satisfy the equation that Ai * Vi = C.
As there are multiple balls, they may collide with each other during the moving. We suppose all collisions are perfectly elastic collisions.

There are multiple queries. Each query consists of two integers t and k. our task is to find out the k-small velocity of all the balls t seconds after the beginning.

* Perfectly elastic collision : A perfectly elastic collision is defined as one in which there is no loss of kinetic energy in the collision.

Input

The first line contains an integer T, denoting the number of testcases.

For each testcase, the first line contains two integers n <= 10^5 and C <= 10^9.
n lines follow. The i-th of them contains three integers Vi, Xi, Di. Vi denotes the initial velocity of ball i. Xi denotes the initial position of ball i. Di denotes the direction ball i moves in.

The next line contains an integer q <= 10^5, denoting the number of queries.
q lines follow. Each line contains two integers t <= 10^9 and 1<=k<=n.
1<=Vi<=10^5,1<=Xi<=10^9

Output

For each query, print a single line containing the answer with accuracy of 3 decimal digits.

Sample Input

Sample Output

6.083
4.796
7.141

这题没做出来的人想必有两类。。。一类是不知道蚂蚁在树枝上爬的那题。。一类是不会积分。。。

通过推导可以得出

完全无视初始位置和方向，开干：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const int maxn=100000+5;
long long n,c;
long long save[maxn];
int main() {
    int t;
    scanf("%d",&t);
    long long vi,xi,di,q;
    long long i,j,k,kill;
    while(t--){
        scanf("%lld%lld",&n,&c);
        for(i=1;i<=n;i++){
            scanf("%lld%lld%lld",&save[i],&xi,&di);
        }
        sort(save+1, save+1+n);
        scanf("%lld",&q);
        for(i=1;i<=q;i++){
            scanf("%lld%lld",&k,&kill);
            double result = sqrt(2*k*c+(save[kill]*save[kill]));
            printf("%.3lf\n",result);
        }
    }
    return 0;
}