QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#762682#9552. The ChariotKXDdesuWA 15ms10604kbPython3799b2024-11-19 16:09:152024-11-19 16:09:16

Judging History

你现在查看的是最新测评结果

  • [2024-11-19 16:09:16]
  • 评测
  • 测评结果:WA
  • 用时:15ms
  • 内存:10604kb
  • [2024-11-19 16:09:15]
  • 提交

answer

t = int(input())
def solve():
    A, B, C, X, Y, D = map(int, input().split())
    if D <= X:
        print(A)
    elif D <= X + Y:
        dist1 = (D + X - 1) // X * A
        dist2 = D // X * A + D % X * B
        ans = min(dist1, dist2)
        print(ans)
    else:
        dist1 = (D + X - 1) // X * A
        dist2 = D // X * A + (D % X * B if D % X <= Y else B * Y + (D % X - Y) * C)
        costAB = D // (X + Y) * (A + Y * B)
        modAB = D % (X + Y)
        cntB = D // (X + Y ) * Y
        dist3 = costAB + (A - min(cntB, X - modAB) * B if modAB <= X else A + (modAB - X) * B)
        dist4 = A + Y * B + (D - X - Y) * (C - B)
        dist5 = costAB + modAB * C
        ans = min(dist1, dist2, dist3, dist4, dist5)
        print(ans)
for _ in range(t):
    solve()

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 15ms
memory: 10604kb

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
1660
999
-9979999999999799302

result:

wrong answer 3rd lines differ - expected: '3226', found: '1660'