Submission #1610151
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define INF 900000000 #define LINF 9000000000000000000 typedef long long ll; typedef pair<int, int> P; int n, m1, m2; int a[40], b[40], c[40]; int dp[40][401][401]; int main(){ cin.tie(0); ios::sync_with_stdio(false); cin >> n >> m1 >> m2; for (int i = 0; i < n; i++) cin >> a[i] >> b[i] >> c[i]; for (int i = 0; i < 40; i++) for (int j = 0; j < 401; j++) for (int k = 0; k < 401; k++) dp[i][j][k] = INF; dp[0][0][0] = 0; for (int i = 0; i < n; i++) { for (int j = 0; j <= 400; j++) { for (int k = 0; k <= 400; k++) { if (dp[i][j][k] == INF) continue; dp[i+1][j][k] = min(dp[i+1][j][k], dp[i][j][k]); dp[i+1][j+a[i]][k+b[i]] = min(dp[i][j][k]+c[i], dp[i+1][j+a[i]][k+b[i]]); } } } int ans = INF; for (int i = 1; i <= n; i++) { for (int j = 1; j <= 400; j++) { for (int k = 1; k <= 400; k++) { if (j/m1 == k/m2) { ans = min(ans, dp[i][j][k]); } } } } if (ans == INF) cout << "-1" << endl; else cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Mixing Experiment |
User | moko_freedom |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1092 Byte |
Status | RE |
Exec Time | 109 ms |
Memory | 25344 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 | 11 ms | 25344 KB |
sample_02.txt | AC | 9 ms | 25344 KB |
subtask_1_01.txt | WA | 12 ms | 25344 KB |
subtask_1_02.txt | AC | 10 ms | 25344 KB |
subtask_1_03.txt | WA | 11 ms | 25344 KB |
subtask_1_04.txt | WA | 15 ms | 25344 KB |
subtask_1_05.txt | WA | 16 ms | 25344 KB |
subtask_1_06.txt | WA | 19 ms | 25344 KB |
subtask_1_07.txt | WA | 21 ms | 25344 KB |
subtask_1_08.txt | WA | 23 ms | 25344 KB |
subtask_1_09.txt | WA | 25 ms | 25344 KB |
subtask_1_10.txt | WA | 29 ms | 25344 KB |
subtask_1_11.txt | WA | 32 ms | 25344 KB |
subtask_1_12.txt | RE | 108 ms | 25344 KB |
subtask_1_13.txt | RE | 108 ms | 25344 KB |
subtask_1_14.txt | RE | 109 ms | 25344 KB |
subtask_1_15.txt | RE | 109 ms | 25344 KB |
subtask_1_16.txt | RE | 109 ms | 25344 KB |
subtask_1_17.txt | RE | 109 ms | 25344 KB |
subtask_1_18.txt | RE | 108 ms | 25344 KB |