QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #753834 | #9552. The Chariot | ucup-team5008# | RE | 0ms | 0kb | Python3 | 476b | 2024-11-16 13:42:46 | 2024-11-16 13:42:47 |
answer
T = int(input())
while T > 0:
A,B,C,X,Y,D = map(int, input().split())
ans = 10**5000
if (X+Y) <= D:
ans = min(ans, A+B*Y+(D-X-Y)*C)
mi = D // (X+Y)
if mi >= 1:
ans = min(ans, A*mi+B*Y+min(B,C)*(mi-1)*Y+(D-(X+Y)*mi)*C)
mi = D//X
if D-mi*X <= Y*mi:
ans = min(ans, A*mi+(D-mi*X)*B)
mi = (D+X+Y-1)//(X+Y)
if D-mi*X >= 0:
ans = min(ans, A*mi+(D-mi*X)*B)
ans = min(ans, (D+X-1)//X*A)
print(ans)
T -= 0
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Dangerous Syscalls
input:
5 160 27 41 3 12 3 160 27 41 3 12 4 160 27 41 3 12 99 1 999 999 1 99 999 999 999 1 1 99 9999999999999999
output:
160 187 3226 999 10000000000099799