Submission #2241076
Source Code Expand
N,Ma,Mb=map(int,input().split()) Med=[] cnt_a=0 cnt_b=0 for i in range(N): a=[int(x) for x in input().split()] Med.append(a) cnt_a+=a[0] cnt_b+=a[1] #[i]まででMa=[j],Mb=[k]を作る場合の最小のコストdp #dp[i+1][j+Ma][k+Mb]=min(dp[i][j+Ma][k+Mb],dp[i][j][k]+Cost) #リストをinfで初期化。inf=作れない配合なので、continue。初期値はdp[0][0][0]=0 dp=[[[float('inf') for j in range(cnt_b+1)] for k in range(cnt_a+1)] for i in range(N+1)] dp[0][0][0]=0 for i in range(N): for j in range(cnt_a+1): for k in range(cnt_b+1): if dp[i][j][k]==float('inf'): continue dp[i+1][j][k]=min(dp[i][j][k],dp[i+1][j][k]) dp[i+1][j+Med[i][0]][k+Med[i][1]]=min(dp[i][j+Med[i][0]][k+Med[i][1]],dp[i][j][k]+Med[i][2]) ans=float('inf') for i in range(1,N+1): if i*Ma<401 and i*Mb<401: ans=min(ans,dp[N][i*Ma][i*Mb]) if ans==float('inf'): print(-1) else: print(ans)
Submission Info
Submission Time | |
---|---|
Task | D - Mixing Experiment |
User | kobaya0514 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 958 Byte |
Status | RE |
Exec Time | 1613 ms |
Memory | 82024 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 17 ms | 3064 KB |
sample_02.txt | AC | 17 ms | 3064 KB |
subtask_1_01.txt | RE | 19 ms | 3064 KB |
subtask_1_02.txt | AC | 18 ms | 3064 KB |
subtask_1_03.txt | RE | 20 ms | 3188 KB |
subtask_1_04.txt | RE | 32 ms | 3640 KB |
subtask_1_05.txt | RE | 58 ms | 5364 KB |
subtask_1_06.txt | RE | 149 ms | 9844 KB |
subtask_1_07.txt | AC | 244 ms | 14452 KB |
subtask_1_08.txt | AC | 278 ms | 16884 KB |
subtask_1_09.txt | AC | 451 ms | 25328 KB |
subtask_1_10.txt | AC | 648 ms | 32244 KB |
subtask_1_11.txt | RE | 982 ms | 49008 KB |
subtask_1_12.txt | AC | 1613 ms | 75328 KB |
subtask_1_13.txt | RE | 1611 ms | 82024 KB |
subtask_1_14.txt | RE | 1206 ms | 59252 KB |
subtask_1_15.txt | RE | 1318 ms | 65516 KB |
subtask_1_16.txt | RE | 1488 ms | 75728 KB |
subtask_1_17.txt | RE | 1478 ms | 72928 KB |
subtask_1_18.txt | RE | 1416 ms | 72664 KB |