258人阅读 评论(0)

# Party All the Time

Time Limit: 6000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4945    Accepted Submission(s): 1561

Problem Description
In the Dark forest, there is a Fairy kingdom where all the spirits will go together and Celebrate the harvest every year. But there is one thing you may not know that they hate walking so much that they would prefer to stay at home if they need to walk a long way.According to our observation,a spirit weighing W will increase its unhappyness for S3*W units if it walks a distance of S kilometers.
Now give you every spirit's weight and location,find the best place to celebrate the harvest which make the sum of unhappyness of every spirit the least.

Input
The first line of the input is the number T(T<=20), which is the number of cases followed. The first line of each case consists of one integer N(1<=N<=50000), indicating the number of spirits. Then comes N lines in the order that x[i]<=x[i+1] for all i(1<=i<N). The i-th line contains two real number : Xi,Wi, representing the location and the weight of the i-th spirit. ( |xi|<=106, 0<wi<15 )

Output
For each test case, please output a line which is "Case #X: Y", X means the number of the test case and Y means the minimum sum of unhappyness which is rounded to the nearest integer.

Sample Input
1
4
0.6 5
3.9 10
5.1 7
8.4 10

Sample Output
Case #1: 832

Author
Enterpaise@UESTC_Goldfinger

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
int ca,t,i,j,k,m,n;
double x[50004],w[50004];
double f(double x1)
{   double sum=0;
for(i=1;i<=n;i++)
{ double po=fabs(x[i]-x1);
sum+=w[i]*po*po*po;
}
return sum;
}

int main()
{

scanf("%d",&t);
for(ca=1;ca<=t;ca++)
{
scanf("%d",&n);
memset(x,0,sizeof(x));
memset(w,0,sizeof(w));
for(i=1;i<=n;i++)scanf("%lf%lf",&x[i],&w[i]);
double l=x[1],r=x[n];
double mid=(l+r)/(2.0);
double mmid=(r+mid)/(2.0);
while(r-l>1e-7)
{
if(f(mid)<f(mmid))
{
r=mmid;
mid=(l+r)/(2.0);
mmid=(r+mid)/(2.0);
}
else
{
l=mid;
mid=(l+r)/(2.0);
mmid=(r+mid)/(2.0);
}
}
printf("Case #%d: %.0f\n",ca,min(f(l),f(r)));
}
return 0;
}


0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：7591次
• 积分：414
• 等级：
• 排名：千里之外
• 原创：35篇
• 转载：1篇
• 译文：0篇
• 评论：1条
阅读排行
最新评论