Submission #1772850
Source Code Expand
#include<iostream> #include<algorithm> using namespace std; int N, Ma, Mb; int a[40], b[40], c[40]; int dp[40][401][401]; //dp(i,j,k):=薬iまで見てAがjBがkの時の最低コスト const int INF810 = 1145141919; int main() { 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 j = 0; j <= 400; j++) { for (int k = 0; k <= 400; k++) { dp[i][j][k] = INF810; } } } dp[0][0][0] = 0; dp[0][a[0]][b[0]] = c[0]; for (int i = 1; i < N; i++) { for (int j = 0; j <= 400; j++) { for (int k = 0; k <= 400; k++) { dp[i][j][k] = dp[i - 1][j][k]; if (j - a[i] >= 0 && k - b[i] >= 0) { dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j - a[i]][k - b[i]] + c[i]); } } } } int ans = INF810; for (int i = 1; i <= 400; i++) { if (Ma * i > 400 || Mb * i > 400)break; ans = min(ans, dp[N - 1][Ma * i][Mb * i]); } if (ans == INF810)cout << -1 << endl; else cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Mixing Experiment |
User | Sen |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1038 Byte |
Status | AC |
Exec Time | 24 ms |
Memory | 25344 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 | 3 ms | 2176 KB |
sample_02.txt | AC | 2 ms | 896 KB |
subtask_1_01.txt | AC | 4 ms | 4352 KB |
subtask_1_02.txt | AC | 2 ms | 1536 KB |
subtask_1_03.txt | AC | 4 ms | 4352 KB |
subtask_1_04.txt | AC | 7 ms | 8448 KB |
subtask_1_05.txt | AC | 8 ms | 8448 KB |
subtask_1_06.txt | AC | 11 ms | 12544 KB |
subtask_1_07.txt | AC | 13 ms | 14592 KB |
subtask_1_08.txt | AC | 14 ms | 16640 KB |
subtask_1_09.txt | AC | 17 ms | 18688 KB |
subtask_1_10.txt | AC | 20 ms | 22784 KB |
subtask_1_11.txt | AC | 22 ms | 24832 KB |
subtask_1_12.txt | AC | 24 ms | 25344 KB |
subtask_1_13.txt | AC | 24 ms | 25344 KB |
subtask_1_14.txt | AC | 24 ms | 25344 KB |
subtask_1_15.txt | AC | 23 ms | 25344 KB |
subtask_1_16.txt | AC | 24 ms | 25344 KB |
subtask_1_17.txt | AC | 24 ms | 25344 KB |
subtask_1_18.txt | AC | 23 ms | 25344 KB |