QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #760106 | #9552. The Chariot | _LSA_ | WA | 20ms | 10640kb | Python3 | 625b | 2024-11-18 14:47:23 | 2024-11-18 14:47:24 |
Judging History
answer
T = int(input())
def calc(k):
if(k <= x):
return a
elif(k <= x+y):
return a+(k-x)*b
else:
return a+y*b+(k-x-y)*c
for _ in range(T):
a,b,c,x,y,d = map(int,input().split())
res = calc(d)
if(d <= x):
print(res)
else:
res = min(res,a*(d+x-1)//x)
t = d//x-1
res = min(res,a*t+calc(d-t*x))
if(d <= x+y):
print(res)
else:
t = d//(x+y)
res = min(res,t*(a+y*b)+calc(d-t*(x+y)))
t -= 1
res = min(res,t*(a+y*b)+calc(d-t*(x+y)))
print(res)
详细
Test #1:
score: 100
Accepted
time: 7ms
memory: 10640kb
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: 20ms
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:
179 4 311 133 458 57 29 561 325 15 78 326 21 82 49 204 157 130 97 636 76 32 113 180 39 138 37 605 30 23 88 76 285 20 330 343 183 130 32 43 1 36 30 25 254 170 17 122 83 119 145 92 52 81 25 44 8 21 205 49 51 160 55 82 31 85 192 78 158 25 84 70 164 51 145 240 179 86 2 73 83 5 206 117 54 6 180 58 122 26...
result:
wrong answer 1st lines differ - expected: '126', found: '179'