POJ 3684 Physics Experiment（弹性碰撞）

Physics Experiment

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 2121		Accepted: 731		Special Judge

Description

Simon is doing a physics experiment with N identical balls with the same radius of R centimeters. Before the experiment, all N balls are fastened within a vertical tube one by one and the lowest point of the lowest ball is H meters above the ground. At beginning of the experiment, (at second 0), the first ball is released and falls down due to the gravity. After that, the balls are released one by one in every second until all balls have been released. When a ball hits the ground, it will bounce back with the same speed as it hits the ground. When two balls hit each other, they with exchange their velocities (both speed and direction).

Simon wants to know where are the N balls after T seconds. Can you help him?

In this problem, you can assume that the gravity is constant: g = 10 m/s².

Input

The first line of the input contains one integer C (C ≤ 20) indicating the number of test cases. Each of the following lines contains four integers N, H, R, T.
1≤ N ≤ 100.
1≤ H ≤ 10000
1≤ R ≤ 100
1≤ T ≤ 10000

Output

For each test case, your program should output N real numbers indicating the height in meters of the lowest point of each ball separated by a single space in a single line. Each number should be rounded to 2 digit after the decimal point.

Sample Input

2
1 10 10 100
2 10 10 100

Sample Output

4.95
4.95 10.20

很好的物理题，，，但是很难下手
模拟的话复杂程度很大，，， 先从一个小球开始找规律，，推导出公式后，，观察题目中的碰撞可以类似的
转化为蚂蚁问题模型，，，，，穿梭而过却不改顺序，，，。。。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
double y[110];
double cal(double t2);
double h, r, t;


int main()
{
    int ncase;
    scanf("%d", &ncase);
    while(ncase--)
    {


        int n;
        scanf("%d %lf %lf %lf", &n, &h, &r, &t);
        for(int i=0;i<n;i++)
        {
            y[i]=cal(t-i);
        }
        sort(y,y+n);
        for(int i=0;i<n;i++)
        {
            printf("%.2f%c",y[i]+1.0*2*r*i/100,i==n-1?'\n':' ');
        }
    }


    return 0;
}




double cal(double t2)
{
    if(t2<=0)
    {
        return h;
    }
    double t1=sqrt(2*h/10);
    int k=(int)(t2/t1);
    if(k%2==0)
    {
        return h-0.5*(10)*(t2-k*t1)*(t2-k*t1);
    }
    else
    {
        return h-0.5*(10)*(k*t1+t1-t2)*(k*t1+t1-t2);
    }
}