Submission #2244999
Source Code Expand
#include<iostream> #include<algorithm> #include<string> #include<vector> #include<tuple> #define LL long long #define TT std::tuple<int,int,int> int N, MA, MB; int dp[100][410][410]; std::vector<TT> med; int INF = 100000000; int ans = INF; int main() { std::cin >> N >> MA >> MB; for (int i = 0; i < N; i++) { int a, b, c; std::cin >> a >> b >> c; med.push_back(TT{ a,b,c }); } for (int i = 0; i <= N; i++) { for (int j = 0; j <= 400; j++) { for (int k = 0; k <= 400; k++) { if (j == 0 && k == 0)continue; dp[i][j][k] = INF; } } } for (int i = 1; i <= N; i++) { int a, b, c; std::tie(a, b, c) = med[i - 1]; for (int j = 1; j <= 410; j++) { for (int k = 1; k <= 410; k++) { dp[i][j][k] = dp[i - 1][j][k]; if (j - a >= 0 && k - b >= 0) { dp[i][j][k] = std::min(dp[i][j][k], dp[i - 1][j - a][k - b] + c); } } } } int D = 1; while (MA*D <= 400 && MB*D <= 400) { ans = std::min(ans, dp[N][MA*D][MB*D]); D++; } if (ans == INF)ans = -1; std::cout << ans << std::endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Mixing Experiment |
User | ikefumy |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1091 Byte |
Status | WA |
Exec Time | 23 ms |
Memory | 28928 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:33:33: warning: iteration 409u invokes undefined behavior [-Waggressive-loop-optimizations] dp[i][j][k] = dp[i - 1][j][k]; ^ ./Main.cpp:32:22: note: containing loop for (int k = 1; k <= 410; k++) { ^
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 | 4 ms | 4352 KB |
sample_02.txt | AC | 2 ms | 1536 KB |
subtask_1_01.txt | WA | 4 ms | 4352 KB |
subtask_1_02.txt | WA | 3 ms | 2176 KB |
subtask_1_03.txt | WA | 5 ms | 4352 KB |
subtask_1_04.txt | WA | 7 ms | 8448 KB |
subtask_1_05.txt | WA | 9 ms | 10496 KB |
subtask_1_06.txt | WA | 12 ms | 14592 KB |
subtask_1_07.txt | WA | 13 ms | 16640 KB |
subtask_1_08.txt | WA | 14 ms | 16640 KB |
subtask_1_09.txt | WA | 17 ms | 20736 KB |
subtask_1_10.txt | WA | 19 ms | 22784 KB |
subtask_1_11.txt | WA | 22 ms | 26880 KB |
subtask_1_12.txt | AC | 23 ms | 28928 KB |
subtask_1_13.txt | WA | 23 ms | 28928 KB |
subtask_1_14.txt | WA | 23 ms | 28928 KB |
subtask_1_15.txt | WA | 23 ms | 28928 KB |
subtask_1_16.txt | WA | 23 ms | 28928 KB |
subtask_1_17.txt | WA | 23 ms | 28928 KB |
subtask_1_18.txt | AC | 23 ms | 28928 KB |