/**
* URL:http://acm.pku.edu.cn/JudgeOnline/problem?id=3757
* Author: OWenT
* 0-1分数规划,特殊排序,二分
*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define MAXN 20005
typedef struct
{
double p,b,c;
double pb,pbc;
}bank;
bank bk[MAXN];
double br,bl,bm;// for binary search
double f;// file size
bool cmp(bank a, bank b)
{
return f * a.pbc - bm * a.pb < f * b.pbc - bm * b.pb;
}
double getZFun(const long &k);
int main()
{
long k,n,i;
double res;
scanf("%ld %ld", &n, &k);
scanf("%lf", &f);
for(i = 1; i <= n; i ++)
{
scanf("%lf %lf %lf", &bk[i].p, &bk[i].b, &bk[i].c);
bk[i].pb = bk[i].b * bk[i].p / (bk[i].b + bk[i].p);
bk[i].pbc = bk[i].pb * bk[i].c;
}
//binary search
br = 1e10 + 1;
bl = 0;
while(br - bl > 1e-6)
{
bm = (br + bl) / 2;
sort(bk + 1, bk + n + 1, cmp);
double tmp = getZFun(k);
if(tmp > 0)
bl = bm + 1e-6;
else
br = bm - 1e-6;
}
res = bl;
printf("%.4lf\n", res);
return 0;
}
double getZFun(const long &k)
{
long i;
double sum = 0;
for(i = 1; i <= k; i ++)
sum += f * bk[i].pbc - bm * bk[i].pb;
return sum;
}
使用更快的迭代法:
(该迭代的过程中出现了一个白痴级别的小问题,搞得我WA了无数次,不爽)
/**
* URL:http://acm.pku.edu.cn/JudgeOnline/problem?id=3757
* Author: OWenT
* 0-1分数规划,特殊排序,二分
*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define MAXN 20005
typedef struct
{
double p,b,c;
double pb,pbc;
double sortPar;
}bank;
bank bk[MAXN];
bool cmp(bank a, bank b)
{
return a.sortPar - b.sortPar < 1e-8;
}
int main()
{
long k,n,i;
double f, res, tmpRes;
scanf("%ld %ld", &n, &k);
scanf("%lf", &f);
for(i = 1; i <= n; i ++)
{
scanf("%lf %lf %lf", &bk[i].p, &bk[i].b, &bk[i].c);
bk[i].pb = bk[i].b * bk[i].p / (bk[i].b + bk[i].p);
bk[i].pbc = bk[i].pb * bk[i].c;
}
//更快的迭代
res = 0;
tmpRes = 1e10;
while(fabs(res - tmpRes) > 1e-6)
{
for(i = 1; i <= n; i ++)
bk[i].sortPar = f * bk[i].pbc - res * bk[i].pb;
tmpRes = res;
sort(bk + 1, bk + n + 1, cmp);
double tmpA = 0, tmpB = 0;
for(i = 1; i <= k; i ++)
{
tmpA += f * bk[i].pbc;
tmpB += bk[i].pb;
}
res = tmpA / tmpB;
}
printf("%.4lf\n", tmpRes);
return 0;
}