Submission #1776156
Source Code Expand
#include <iostream> #include <iomanip> #include <cstring> #include <algorithm> #include <queue> #include <functional> #include <map> #include <vector> #include <string> using namespace std; typedef long long ll; const int INF = 1000000; int dp[45][405][405]; int main(void){ int n, a[45], b[45], c[45], ma, mb, suma = 0, sumb = 0; cin >> n >> ma >> mb; for (int i = 0; i < n; i++){ cin >> a[i] >> b[i] >> c[i]; suma += a[i]; sumb += b[i]; } for (int i = 0; i < 45; i++) for (int j = 0; j < 45; j++) dp[0][i][j] = INF; dp[0][0][0] = 0; for (int i = 0; i < n; i++) for (int j = 0; j <= suma; j++) for (int k = 0; k <= sumb; k++){ dp[i + 1][j][k] = dp[i][j][k]; if (a[i] <= j && b[i] <= k) dp[i + 1][j][k] = min(dp[i + 1][j][k], dp[i][j - a[i]][k - b[i]] + c[i]); } int ans = INF; for (int i = 1; i <= suma; i++) for (int j = 1; j <= sumb; j++){ if (ma*j == mb*i) ans = min(ans, dp[n][i][j]); } if (ans == INF) cout << -1 << endl; else cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Mixing Experiment |
User | pin |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1168 Byte |
Status | WA |
Exec Time | 12 ms |
Memory | 25856 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 | 1 ms | 384 KB |
sample_02.txt | AC | 1 ms | 384 KB |
subtask_1_01.txt | AC | 2 ms | 2432 KB |
subtask_1_02.txt | AC | 1 ms | 384 KB |
subtask_1_03.txt | AC | 2 ms | 2560 KB |
subtask_1_04.txt | AC | 3 ms | 6656 KB |
subtask_1_05.txt | WA | 4 ms | 8832 KB |
subtask_1_06.txt | WA | 4 ms | 11008 KB |
subtask_1_07.txt | WA | 5 ms | 13184 KB |
subtask_1_08.txt | WA | 6 ms | 15232 KB |
subtask_1_09.txt | WA | 7 ms | 17408 KB |
subtask_1_10.txt | WA | 8 ms | 21376 KB |
subtask_1_11.txt | WA | 10 ms | 25728 KB |
subtask_1_12.txt | WA | 11 ms | 25728 KB |
subtask_1_13.txt | WA | 12 ms | 25856 KB |
subtask_1_14.txt | WA | 11 ms | 25600 KB |
subtask_1_15.txt | WA | 11 ms | 25728 KB |
subtask_1_16.txt | WA | 12 ms | 25728 KB |
subtask_1_17.txt | WA | 11 ms | 25728 KB |
subtask_1_18.txt | WA | 11 ms | 25728 KB |