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
思路:
很明显的三分题,直接套用三分模板。
注意:
此题在计算s³时,若采用pow()函数,会TLE,直接累乘就可以AC了,下面放AC代码。
// #define LOCAL
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dd;
const dd eps = 1e-8;
const int maxn = 50000+10;
typedef struct {
dd x; //位置
dd w; //体重
} spirit;
spirit a[maxn];
/* define a function to count sum of unhappiness */
dd f (dd s, spirit* a, int n) {
dd sum = 0;
for (int i = 0; i < n; i++) {
sum += fabs((s-a[i].x) * (s-a[i].x) * (s-a[i].x) * a[i].w);
//这里不用pow()
}
return sum;
}
int main(void)
{
#ifdef LOCAL
freopen ("in.txt", "r", stdin);
freopen ("out.txt", "w", stdout);
#endif
int t;
cin >> t;
for (int cnt = 1; cnt <= t; cnt ++) {
int n;
cin >> n;
/* 读入spirit数组 */
for (int i = 0; i < n; i++) {
scanf("%lf %lf", &a[i].x, &a[i].w);
}
/* 三分查找最小值 */
dd l = -1e6, r = 1e6;
while (r-l > eps) {
dd m1 = l + (r-l) / 3;
dd m2 = r - (r-l) / 3;
if(f(m1,a,n) > f(m2,a,n))
l = m1;
else
r = m2;
}
/* 输出 */
printf("Case #%d: %.0f\n", cnt, f(l,a,n));
}
return 0;
}