QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #783544 | #9552. The Chariot | Inkyo | WA | 24ms | 10580kb | Python3 | 646b | 2024-11-26 10:29:56 | 2024-11-26 10:29:56 |
Judging History
answer
t = int(input())
for i in range(t):
a, b, c, x, y, d = map(int, input().split())
def cost(dis):
if dis == 0:
return 0
elif dis <= x:
return a
elif dis <= x + y:
return a + (dis - x) * b
else:
return a + b * y + (dis - x - y) * c
def qmin(dis):
ret = cost(dis) * (d // dis) + cost(d % dis)
if d > dis:
ret = min(ret, cost(dis) * (d // dis - 1) + cost(d % dis + dis))
return ret
ans = min(qmin(x), qmin(x + y), qmin(d), (d // (x + y)) * cost(x + y) + a - (x - d % (x + y)) * b)
print(ans)
详细
Test #1:
score: 100
Accepted
time: 15ms
memory: 10580kb
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
result:
ok 5 lines
Test #2:
score: -100
Wrong Answer
time: 24ms
memory: 10576kb
input:
2077 63 88 64 47 55 88 4 75 38 53 33 41 41 1 28 6 13 100 57 88 77 35 5 48 100 36 97 24 93 87 57 25 26 84 62 18 29 11 33 88 86 71 33 16 7 4 73 68 50 65 72 14 43 78 15 31 72 42 39 29 31 10 76 58 35 89 39 55 99 11 16 82 21 18 57 44 80 16 38 31 99 58 59 69 24 22 69 76 14 83 96 40 56 31 14 36 75 84 27 57...
output:
126 -896 310 -1822 400 -1593 -158 561 300 -388 62 312 -483 76 48 192 150 130 -5777 636 -4248 -205 112 180 -55 138 36 605 -866 -817 88 -4460 285 -5680 330 325 174 128 32 36 -2009 -4374 -1374 24 192 170 17 88 -1072 102 140 -3106 -578 52 -599 -3673 -1360 -357 180 -3617 -3027 145 -3175 -8 -567 -1724 156...
result:
wrong answer 2nd lines differ - expected: '4', found: '-896'