Submission #1102760
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll=long long; const int nmax=40,abmax=10,inf = 1000000; int a[nmax],b[nmax],c[nmax]; int dp[nmax+1][nmax*abmax+1][nmax*abmax+1]; int main(void){ int n,ma,mb; cin >> n >> ma >> mb; for(int i=0;i<n;++i){ cin >> a[i] >> b[i] >> c[i]; } for(int i = 0; i <= n; ++i){ for(int ca = 0; ca <= nmax*abmax; ++ca){ for(int cb = 0; cb <= nmax*abmax; ++cb){ dp[i][ca][cb]=inf; } } } dp[0][0][0]=0; for(int i = 0; i < n; ++i){ for(int ca = 0; ca <= nmax*abmax; ++ca){ for(int cb = 0; cb <= nmax*abmax; ++cb){ if(dp[i][ca][cb]==inf) continue; dp[i+1][ca][cb]=min(dp[i+1][ca][cb],dp[i][ca][cb]); dp[i+1][ca+a[i]][cb+b[i]]=min(dp[i+1][ca+a[i]][cb+b[i]],dp[i][ca][cb]+c[i]); } } } int ans=inf; for(int ca = 1; ca <= nmax*abmax; ++ca){ for(int cb = 1; cb <= nmax*abmax; ++cb){ if(ca*mb==cb*ma) ans=min(ans,dp[n][ca][cb]); } } if(ans==inf) ans=-1; cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Mixing Experiment |
User | Hec |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1033 Byte |
Status | AC |
Exec Time | 19 ms |
Memory | 25984 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 | 4 ms | 4352 KB |
sample_02.txt | AC | 2 ms | 1536 KB |
subtask_1_01.txt | AC | 4 ms | 4352 KB |
subtask_1_02.txt | AC | 3 ms | 2176 KB |
subtask_1_03.txt | AC | 4 ms | 4352 KB |
subtask_1_04.txt | AC | 6 ms | 8448 KB |
subtask_1_05.txt | AC | 7 ms | 10496 KB |
subtask_1_06.txt | AC | 9 ms | 12544 KB |
subtask_1_07.txt | AC | 10 ms | 14592 KB |
subtask_1_08.txt | AC | 12 ms | 16640 KB |
subtask_1_09.txt | AC | 13 ms | 18688 KB |
subtask_1_10.txt | AC | 16 ms | 22784 KB |
subtask_1_11.txt | AC | 18 ms | 24832 KB |
subtask_1_12.txt | AC | 19 ms | 25984 KB |
subtask_1_13.txt | AC | 19 ms | 25984 KB |
subtask_1_14.txt | AC | 19 ms | 25984 KB |
subtask_1_15.txt | AC | 19 ms | 25984 KB |
subtask_1_16.txt | AC | 19 ms | 25984 KB |
subtask_1_17.txt | AC | 19 ms | 25984 KB |
subtask_1_18.txt | AC | 19 ms | 25984 KB |