首页 > 代码库 > Galaxy (hdu 5073 数学)
Galaxy (hdu 5073 数学)
Galaxy
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 827 Accepted Submission(s): 201
Special Judge
Problem Description
Good news for us: to release the financial pressure, the government started selling galaxies and we can buy them from now on! The first one who bought a galaxy was Tianming Yun and he gave it to Xin Cheng as a present.
To be fashionable, DRD also bought himself a galaxy. He named it Rho Galaxy. There are n stars in Rho Galaxy, and they have the same weight, namely one unit weight, and a negligible volume. They initially lie in a line rotating around their center of mass.
Everything runs well except one thing. DRD thinks that the galaxy rotates too slow. As we know, to increase the angular speed with the same angular momentum, we have to decrease the moment of inertia.
The moment of inertia I of a set of n stars can be calculated with the formula
where wi is the weight of star i, di is the distance form star i to the mass of center.
As DRD’s friend, ATM, who bought M78 Galaxy, wants to help him. ATM creates some black holes and white holes so that he can transport stars in a negligible time. After transportation, the n stars will also rotate around their new center of mass. Due to financial pressure, ATM can only transport at most k stars. Since volumes of the stars are negligible, two or more stars can be transported to the same position.
Now, you are supposed to calculate the minimum moment of inertia after transportation.
To be fashionable, DRD also bought himself a galaxy. He named it Rho Galaxy. There are n stars in Rho Galaxy, and they have the same weight, namely one unit weight, and a negligible volume. They initially lie in a line rotating around their center of mass.
Everything runs well except one thing. DRD thinks that the galaxy rotates too slow. As we know, to increase the angular speed with the same angular momentum, we have to decrease the moment of inertia.
The moment of inertia I of a set of n stars can be calculated with the formula
where wi is the weight of star i, di is the distance form star i to the mass of center.
As DRD’s friend, ATM, who bought M78 Galaxy, wants to help him. ATM creates some black holes and white holes so that he can transport stars in a negligible time. After transportation, the n stars will also rotate around their new center of mass. Due to financial pressure, ATM can only transport at most k stars. Since volumes of the stars are negligible, two or more stars can be transported to the same position.
Now, you are supposed to calculate the minimum moment of inertia after transportation.
Input
The first line contains an integer T (T ≤ 10), denoting the number of the test cases.
For each test case, the first line contains two integers, n(1 ≤ n ≤ 50000) and k(0 ≤ k ≤ n), as mentioned above. The next line contains n integers representing the positions of the stars. The absolute values of positions will be no more than 50000.
For each test case, the first line contains two integers, n(1 ≤ n ≤ 50000) and k(0 ≤ k ≤ n), as mentioned above. The next line contains n integers representing the positions of the stars. The absolute values of positions will be no more than 50000.
Output
For each test case, output one real number in one line representing the minimum moment of inertia. Your answer will be considered correct if and only if its absolute or relative error is less than 1e-9.
Sample Input
23 2-1 0 14 2-2 -1 1 2
Sample Output
00.5
Source
2014 Asia AnShan Regional Contest
题意：数轴上有n个点，每个点重量1 ，可以移动其中k个点到任何位置， 使得题中式子的值最小 。
思路：具体推导过程看这位大神~
代码：
1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <algorithm> 5 #include <cmath> 6 #include <string> 7 #include <map> 8 #include <stack> 9 #include <vector>10 #include <set>11 #include <queue>12 #pragma comment (linker,"/STACK:102400000,102400000")13 #define maxn 5005014 #define MAXN 200515 #define mod 100000000916 #define INF 0x3f3f3f3f17 #define pi acos(-1.0)18 #define eps 1e-619 typedef long long ll;20 using namespace std;21 22 double a[maxn];23 24 int main()25 {26 int n,k,cas;27 double t,sum1,sum2;28 scanf("%d",&cas);29 while (cas--)30 {31 scanf("%d%d",&n,&k);32 sum1=0.0;33 sum2=0.0;34 for (int i=1;i<=n;i++)35 scanf("%lf",&a[i]);36 if (n==1||n==k||k==(n-1))37 {38 printf("0.00000000000\n");39 continue;40 }41 sort(a+1,a+n+1);42 for (int i=1;i<=n-k;i++)43 {44 sum1+=a[i];45 sum2+=a[i]*a[i];46 }47 double ans=(n-k)*sum2-sum1*sum1;48 for (int i=1;i<=k;i++)49 {50 sum1=sum1+a[n-k+i]-a[i];51 sum2=sum2+a[n-k+i]*a[n-k+i]-a[i]*a[i];52 double temp=(n-k)*sum2-sum1*sum1;53 if (temp<ans)54 ans=temp;55 }56 printf("%.11f\n",(double)ans/(double)(n-k));57 }58 return 0;59 }
Galaxy (hdu 5073 数学)
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。