HDU 4355 Party All the Time (三分水题。。。留着TLE)
来源:互联网 发布:遍历对象数组 编辑:程序博客网 时间:2024/05/19 14:19
HDU 4355 Party All the Time
Party All the Time
Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2400 Accepted Submission(s): 803
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.
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
140.6 53.9 105.1 78.4 10
Sample Output
Case #1: 832
#pragma comment(linker, "/STACK:102400000,102400000")#include "iostream"#include "cstring"#include "algorithm"#include "cmath"#include "cstdio"#include "sstream"#include "queue"#include "vector"#include "string"#include "stack"#include "cstdlib"#include "deque"#include "fstream"#include "map"using namespace std;typedef long long LL;const int INF = 0x1fffffff;const int MAXN = 1000000+100;#define eps 1e-14const int mod = 100000007;int n;double rst;struct node{ double pos; double weight;}spirit[50000+100];double cal(double pos){ double sum=0; for (int i=0;i<n;i++) sum+=pow(fabs(pos-spirit[i].pos),3)*spirit[i].weight; return sum;}int main(){ //freopen("in","r",stdin); int t; scanf("%d",&t); for (int kase=1;kase<=t;kase++) { scanf("%d",&n); int cnt=0; double l,r; for (int i=0;i<n;i++) { scanf("%lf%lf",&spirit[i].pos,&spirit[i].weight); l=min(l,spirit[i].pos); r=max(r,spirit[i].pos); } do { double m=(l+r)/2.0;//三分 double mm=(m+r)/2.0; rst=cal(m); if (rst<cal(mm)) r=mm; else l=m; }while (cnt++<100);//据说比赛要用这个跳出 printf("Case #%d: %.0lf\n" ,kase,rst); } return 0;}
- HDU 4355 Party All the Time (三分水题。。。留着TLE)
- hdu 4355 Party All the Time
- hdu 4355 Party All the Time
- HDU 4355 - Party All the Time
- hdu 4355 party all the time 三分法
- HDU 4355 Party All the Time 三分
- hdu 4355 Party All the Time (三分)
- HDU 4355 Party All the Time 三分
- hdu 4355 Party All the Time
- hdu 4355 Party All the Time 三分
- HDU 4355 Party All the Time
- HDU 4355 Party All the Time
- HDU 4355 Party All the Time
- HDU 4355 Party All the Time(三分)
- Party All the Time HDU
- HDU 4355 Party All the Time(三分)
- HDU 4355 Party All the Time(三分)
- HDU 4355 - Party All the Time(三分)
- UVALive 6170
- 【很赞的一片文章】android获取手机号码(主要是移动手机)
- UVa 11292 Dragon of Loowater
- Android Fragment完全解析,关于碎片你所需知道的一切
- gvim插件的安装ctag、taglist、cscope(转)
- HDU 4355 Party All the Time (三分水题。。。留着TLE)
- linux目录配置
- HDU 1452 Happy 2004(因子和)
- php怎么不让html效果显示而是直接显示代码
- java基础入门----Collections.reverseOrder
- CSS Media Query
- 微信公众平台开发__微信的关注事件
- poj 2376 Cleaning Shifts( 贪心 )
- 《失控》书摘