QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #759058 | #9552. The Chariot | light_ink_dots# | WA | 100ms | 10736kb | Python3 | 838b | 2024-11-17 21:23:03 | 2024-11-17 21:23:03 |
Judging History
answer
T = int(input())
for i in range(1, T + 1):
A,B,C,X,Y,D = map(int,input().split())
if(i==22):
print(A,B,C,X,Y,D)
ans = 10**5000
# at most one AB/ABC, else all A
tmp = (D//X)*A
if(D%X):
tmp += min(A, min(D%X,Y)*B+max(D%X-Y,0)*C)
ans = min(ans,tmp)
# print(ans)
# at most one A/AB/ABC, else all AB
if(D>=X+Y):
tmp = (D//(X+Y))*(A+B*Y)
if(D%(X+Y)):
tmp += min(A+max(D%(X+Y)-X,0)*B, C*(D%(X+Y)))
ans = min(ans,tmp)
# at most one A and one AB, else all AB
if(D>X+X):
tmp = ((D-X-X)//(X+Y))*(A+B*Y)+A+A
tmp += min((D-X-X)%(X+Y),Y)*B+max((D-X-X)%(X+Y)-Y,0)*C
ans = min(ans,tmp)
# print(ans)
# just ABC
tmp = A+max(min(D-X,Y),0)*B+max(D-X-Y,0)*C
ans = min(ans,tmp)
print(ans)
詳細信息
Test #1:
score: 100
Accepted
time: 11ms
memory: 10736kb
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: 100ms
memory: 10608kb
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 4 310 114 400 57 29 561 300 15 62 312 21 76 48 192 150 130 97 636 76 32 3 47 88 82 9 27 112 180 39 138 36 605 30 23 88 76 285 20 330 325 174 128 32 36 1 36 30 24 192 170 17 88 83 102 140 86 52 81 25 44 8 21 180 49 51 145 55 82 31 85 156 70 158 21 84 48 156 51 145 174 156 86 2 73 83 5 200 117 44 ...
result:
wrong answer 22nd lines differ - expected: '32', found: '32 3 47 88 82 9'