A - Hunters
Time Limit:1000MS Memory Limit:32768KB 64bitIO Format:%I64d & %I64u
Description
Alice and Bob are the topmost hunters in the forest, so no preys canescape from them. However, they both think that its hunting skill is betterthan the other. So they need a match.
In their match, the targets are two animals, a tiger and a wolf. They both knowthat the tiger is living in the south of the forest and the wolf is living inthe north of the forest. They decide that the one who kills the tiger scores Xpoints and who kills the
wolf scores Y points. If the one who kills both tigerand wolf scores X+Y points.
Before the match starts, Aliceis in the east of the forest and Bob is in the west of the forest. When thematch starts, Alice and Bob will choose one of the preys as targets. Becausethey haven't known the other's choice, maybe they choose the same target. Therewill
be two situations:
(1) If they choose different targets, they both are sure of killing theirrespective targets.
(2) If they choose the same target, the probability of Alice killing the target is P, and theprobability of Bob killing it is 1-P. Then they will hunt for the other prey,also the probability of Alicekilling it is P and the probability of Bob killing it is 1-P.
But Alice knowsabout Bob. She knows that the probability of Bob choosing tiger as his firsttarget is Q, and the probability of choosing wolf is 1-Q. So that Alice can decide herfirst target to make her expected score as high as possible.
Input
The first line of input contains an integer T (1≤T≤10000), the numberof test cases.
Then T test cases follow. Each test case contains X, Y, P, Q in one line. X andY are integers and 1≤X, Y≤1000000000. P and Q are decimals and 0≤P, Q≤1, andthere are at most two digits after decimal point.
Output
For each test case, output the target Alice should choose and the highest expectedscore she can get, in one line, separated by a space. The expected score shouldbe rounded to the fourth digit after decimal point. It is guaranteed that Alice will have differentexpected score between choosing tiger and wolf.
Sample Input
3
2 1 0.5 0.5
2 1 0 1
7 7 0.32 0.16
Sample Output
tiger 1.7500
wolf 1.0000
tiger 6.5968
这是求期望值的简单数学题。代码如下:
#include"stdio.h"
int main()
{
int T;
int x,y;
double p,q,d1,d2;
scanf("%d",&T);
while(T--)
{
scanf("%d%d%lf%lf",&x,&y,&p,&q);
d1=(1-q)*x+p*q*(x+y);
d2=(1-q)*p*(x+y)+q*y;
if(d1>d2)
{
printf("tiger %.4lf\n",d1);
}
else
{
printf("wolf %.4lf\n",d2);
}
}
return 0;
}
在森林中,Alice 和 Bob 是顶级猎手,他们决定通过猎杀老虎和狼来比拼技能。Alice 了解 Bob 的选择概率,利用此信息决定最佳猎物以最大化预期得分。

被折叠的 条评论
为什么被折叠?



