QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#759211 | #9552. The Chariot | Yzm007 | WA | 14ms | 10620kb | Python3 | 757b | 2024-11-17 23:09:04 | 2024-11-17 23:09:06 |
Judging History
answer
t = int(input())
while t > 0:
t -= 1
a, b, c, x, y, d = map(int, input().split())
ans = (d+x-1)//x * a
if d >= x+y:
ans = min(ans, a+b*y+(d-x-y)*c)
d2 = (d-(x+y))//x
d3 = d-d2*x
ans = min(ans, d2*a+a+b*y+(d3-x-y)*c)
d4 = (d-(x+y))//(x+y)
d5 = d-d4*(x+y)
ans = min(ans, d4 * (a+b*y) + a + b * y + (d5 - x - y) * c)
if d >= x:
k = d//x
if d <= k*(x+y):
d6 = d-k*x
ans = min(ans, k*a+d6*b)
k2 = (d+x+y-1)//(x+y)
if d >= k2*x:
d7 = d-k2*x
ans = min(ans, k2*a+d7*b)
k2 -= 1
if d >= k2*x:
d7 = d-k2*x
ans = min(ans, k2*a+d7*b)
print(ans)
详细
Test #1:
score: 0
Wrong Answer
time: 14ms
memory: 10620kb
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:
81 108 3147 999 10000000000099799
result:
wrong answer 1st lines differ - expected: '160', found: '81'