2020ICPC南京 F Fireworks（概率，三分）

链接

题目描述

Kotori is practicing making fireworks for the upcoming hanabi taikai1. It takes her nn minutes to make a single firework, and as she is not really proficient in making fireworks, each firework only has a probability of $p\times 10^{-4}$ to be perfect.

After she finishes making a firework, she can just start making the next firework, or take mm minutes to light all the remaining fireworks finished before. If there is at least one perfect firework among the lit ones, she will be happy and go to rest. Otherwise, she will continue practicing. Can you tell her the minimum expected practicing time before she goes to rest if she takes the optimal strategy?

Notice that no matter how many fireworks remain, it always takes mm minutes to light them all.

Hanabi taikai: Romaji of the Japanese word “花火大會”, which means the firework… err… party?

输入描述:

There are multiple test cases. The first line of the input contains an integer $T$ $(1\le T\le 10^4)$ indicating the number of test cases. For each test case:

The first and only line contains three integers $n$, $m$ and $p$ $(1\le n,m\le 10^9,1\le p\le 10^4)$.

输出描述:

For each test case, output one line containing one number indicating the minimum expected practicing time.

Your answer will be considered correct if and only if the absolute or relative error does not exceed $10^{-4}$.

输入

3
1 1 5000
1 1 1
1 2 10000

输出

4.0000000000
10141.5852891136
3.0000000000

思路

设做好 $x$ 个烟花再点燃是最策略，$d{p}_x$ 代表这一策略花费时间的期望，那么有：$d{p}_x=n\times i+m+(i-p{)}^{i}d{p}_x$ 。其中 $(1-p{)}^{i}d{p}_x$ 代表已经制作好的 $i$ 个烟花有 $(1-p{)}^i$ 的概率都是不完美的，那么就需要再制造 $k$ 个烟花来点燃。

那么 $d{p}_x=\frac{n\times i+m}{1-(1-p{)}^i}$。

令 $f(x)=\frac{ax+b}{1-c^x}$ ，$(0<c<1)$，那么$f^{\prime }(x)=\frac{a(1-c^x)+c^{x}lnc(ax+b)}{(1-c^x{)}^2}$。先递减再递增，是个单峰函数，使用三分求出最值。

#include<bits/stdc++.h>
using namespace std;
int T,n,m; double p;

double qpow(double a,int b){
	double ret=1;
	while(b){
		if(b&1) ret=ret*a;
		a=a*a; b>>=1;
	}
	return ret;
}

double calc(int i){
	return ((double)n*i+m)/(1-qpow(1-p*1e-4,i));
}


void solve(){
	cin>>n>>m>>p;
	int l=1,r=1e9;
	while(l<r){
		int midl=(l+r)>>1;
		int midr=midl+1;
		if(calc(midl)<calc(midr)) r=midr-1;
		else l=midl+1;
	}
	cout<<setprecision(10)<<fixed<<calc(l)<<"\n";
}

int main(){
	ios::sync_with_stdio(false);
	for(cin>>T;T;T--) solve();
}