F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Might and Magic

Time Limit: 20000/20000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 121    Accepted Submission(s): 41


Problem Description
Two heroes are fighting, whose names are hero $0$ and hero $1$ respectively.

You are controlling the hero $0$, and your enemy is the hero $1$. Each hero has five integer attributes: ATTACK, DEFENCE, POWER, KNOWLEDGE, and HEALTH. When two heroes battle with each other, they will take turns to attack and your hero moves first. One hero can make $\pmb{\text{exactly one attack}}$ in one turn, either a physical attack or a magical attack.

Assume their attritubes are $A_i,D_i,P_i,K_i,H_i(0 \leq i \leq 1)$. For hero $i$, its physical attack's damage is $C_p \max(1,A_i-D_{1-i})$ while its magical attack's damage is $C_m P_i$ where $C_p, C_m$ are given constants.

Hero $i$ can make magical attacks no more than $K_i$ times in the whole battle. After hero $i$'s attack, $H_{1-i}$ will decrease by the damage of its enemy. If $H_{1-i}$ is lower or equal to $0$, the hero $(1-i)$ loses and the battle ends.

Now you know your enemy is Yog who is utterly ignorant of magic, which means $P_1=K_1=0$ and he will only make physical attacks. You can distribute $N$ attribute points to four attributes $A_0, D_0, P_0, K_0$ arbitrarily which means these attributes can be any non-negative integer satisfying $0 \leq A_0+D_0+P_0+K_0 \leq N$.

Given $C_p,C_m,H_0,A_1,D_1$ and $N$, please calculate the maximum $H_1$ that you have a chance to win.
 

Input
The first line contains an integer $T(1 \leq T \leq 10^5)$ - the number of test cases. Then $T$ test cases follow.

The only line of each test case contains six integers $C_p,C_m,H_0,A_1,D_1,N(1 \leq C_p,C_m,H_0,A_1,D_1,N \leq 10^6)$ - attritubes described above.
 

Output
For each test case, output one integer representing the answer.
 

Sample Input
2 1 1 4 5 1 4 2 5 1 9 9 6
 

Sample Output
4 25
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-06-29 17:51:30, Gzip enabled