Submission #1592728
Source Code Expand
n, ma, mb = map(int,input().split()) a = [0] * (n + 1) b = [0] * (n + 1) c = [0] * (n + 1) for i in range(1, n + 1): a[i], b[i], c[i] = map(int,input().split()) #iまでの薬品で、aがj(g),bがk(g)となるときの最小コスト dp = [[[10 ** 15 for i in range(n + 1)] for j in range(401)] \ for k in range(401)] dp[0][0][0] = 0 sa = [0] * (n + 1) sb = [0] * (n + 1) for i in range(1, n + 1): sa[i] = sa[i - 1] + a[i] sb[i] = sb[i - 1] + b[i] for i in range(1, n + 1): for j in range(sa[i] + 1): for k in range(sb[i] + 1): if j < a[i] or k < b[i]: dp[k][j][i] = dp[k][j][i - 1] else: dp[k][j][i] = min(dp[k][j][i - 1], \ dp[k - b[i]][j - a[i]][i - 1] + c[i]) i = 1 ans = 10 ** 15 while True: if i * ma > 400 or i * mb > 400: break ans = min(ans, dp[i * mb][i * ma][n]) i += 1 if ans == 10 ** 15: ans = -1 print(ans)
Submission Info
Submission Time | |
---|---|
Task | D - Mixing Experiment |
User | ophelia |
Language | PyPy3 (2.4.0) |
Score | 400 |
Code Size | 995 Byte |
Status | AC |
Exec Time | 415 ms |
Memory | 115548 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 222 ms | 56668 KB |
sample_02.txt | AC | 213 ms | 55004 KB |
subtask_1_01.txt | AC | 233 ms | 62300 KB |
subtask_1_02.txt | AC | 214 ms | 56284 KB |
subtask_1_03.txt | AC | 233 ms | 62428 KB |
subtask_1_04.txt | AC | 259 ms | 73308 KB |
subtask_1_05.txt | AC | 255 ms | 74076 KB |
subtask_1_06.txt | AC | 278 ms | 86364 KB |
subtask_1_07.txt | AC | 277 ms | 86364 KB |
subtask_1_08.txt | AC | 285 ms | 86364 KB |
subtask_1_09.txt | AC | 303 ms | 99932 KB |
subtask_1_10.txt | AC | 319 ms | 99964 KB |
subtask_1_11.txt | AC | 352 ms | 115036 KB |
subtask_1_12.txt | AC | 403 ms | 115548 KB |
subtask_1_13.txt | AC | 415 ms | 115548 KB |
subtask_1_14.txt | AC | 380 ms | 115292 KB |
subtask_1_15.txt | AC | 386 ms | 115164 KB |
subtask_1_16.txt | AC | 392 ms | 115164 KB |
subtask_1_17.txt | AC | 405 ms | 115164 KB |
subtask_1_18.txt | AC | 404 ms | 115164 KB |