Hunters

Problem Description

Alice and Bob are the topmost hunters in the forest, so no preys can escape from them. However, they both think that its hunting skill is better than the other. So they need a match.
In their match, the targets are two animals, a tiger and a wolf. They both know that the tiger is living in the south of the forest and the wolf is living in the north of the forest. They decide that the one who kills the tiger scores X points and who kills the wolf scores Y points. If the one who kills both tiger and wolf scores X+Y points.
Before the match starts, Alice is in the east of the forest and Bob is in the west of the forest. When the match starts, Alice and Bob will choose one of the preys as targets. Because they haven‘t known the other‘s choice, maybe they choose the same target. There will be two situations:
(1) If they choose different targets, they both are sure of killing their respective targets.
(2) If they choose the same target, the probability of Alice killing the target is P, and the probability of Bob killing it is 1-P. Then they will hunt for the other prey, also the probability of Alice killing it is P and the probability of Bob killing it is 1-P.
But Alice knows about Bob. She knows that the probability of Bob choosing tiger as his first target is Q, and the probability of choosing wolf is 1-Q. So that Alice can decide her first target to make her expected score as high as possible.

 

Input

The first line of input contains an integer T (1≤T≤10000), the number of test cases.
Then T test cases follow. Each test case contains X, Y, P, Q in one line. X and Y are integers and 1≤X, Y≤1000000000. P and Q are decimals and 0≤P, Q≤1, and there are at most two digits after decimal point.

 

Output

For each test case, output the target Alice should choose and the highest expected score she can get, in one line, separated by a space. The expected score should be rounded to the fourth digit after decimal point. It is guaranteed that Alice will have different expected 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

 

Source

2012 Asia Tianjin Regional Contest

 

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

int main()
{
	int T;
	double x, y, p, q;
	scanf("%d", &T);
	while(T--)
	{
		scanf("%lf %lf %lf %lf", &x, &y, &p, &q);
		double ans1 = q*(x*p+y*p) + (1-q)*x, ans2 = (1-q)*(x*p+y*p) + q*y;
		if(ans1 > ans2)printf("tiger %.4lf\n", ans1);
		else printf("wolf %.4lf\n", ans2);
	}
	return 0;
} 

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define max(a,b) (a)>(b)?(a):(b)
using namespace std;

int main()
{
    int T, x, y;
    double p, q;
    scanf("%d", &T);
    while(T--)
    {
        scanf("%d %d %lf %lf", &x, &y, &p, &q);
        double ans1=q*(x*p+y*p) + (1-q)*x, ans2=(1-q)*(x*p+y*p) + q*y;
        double ans = max(ans1, ans2);
        if(ans-ans1<1e-6)printf("tiger ");  //不能写ans==ans1，会产生浮点数误差！！ 
        else printf("wolf ");
        printf("%.4lf\n", ans);
    }
    return 0;
}