Submission #2241052
Source Code Expand
N,Ma,Mb=map(int,input().split()) Med=[] for i in range(N): a=[int(x) for x in input().split()] Med.append(a) #[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(401)] for k in range(401)] for i in range(N+1)] dp[0][0][0]=0 for i in range(N): for j in range(401): for k in range(401): 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 | 894 Byte |
Status | TLE |
Exec Time | 2121 ms |
Memory | 215412 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 | 306 ms | 23540 KB |
sample_02.txt | AC | 131 ms | 13172 KB |
subtask_1_01.txt | AC | 498 ms | 33780 KB |
subtask_1_02.txt | AC | 212 ms | 18420 KB |
subtask_1_03.txt | AC | 469 ms | 33780 KB |
subtask_1_04.txt | AC | 872 ms | 59380 KB |
subtask_1_05.txt | AC | 1238 ms | 74864 KB |
subtask_1_06.txt | AC | 1698 ms | 100596 KB |
subtask_1_07.txt | AC | 1954 ms | 116336 KB |
subtask_1_08.txt | TLE | 2112 ms | 126540 KB |
subtask_1_09.txt | TLE | 2115 ms | 152292 KB |
subtask_1_10.txt | TLE | 2117 ms | 177524 KB |
subtask_1_11.txt | TLE | 2119 ms | 203252 KB |
subtask_1_12.txt | TLE | 2120 ms | 213364 KB |
subtask_1_13.txt | TLE | 2119 ms | 215412 KB |
subtask_1_14.txt | TLE | 2120 ms | 213364 KB |
subtask_1_15.txt | TLE | 2121 ms | 213492 KB |
subtask_1_16.txt | TLE | 2120 ms | 213492 KB |
subtask_1_17.txt | TLE | 2118 ms | 213364 KB |
subtask_1_18.txt | TLE | 2120 ms | 213364 KB |