Submission #1103315
Source Code Expand
#include<iostream> #include<vector> #include<string> #include<cstring> #include<algorithm> #include<map> #include<set> #include<cmath> #include<cassert> #include<queue> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef vector<int> vi; struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star; int dp[44][444][444]; int A[44], B[44], C[44]; const int INF = 1e9; int main() { 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 < 44; i++) for (int j = 0; j < 444; j++) for (int k = 0; k < 444; k++) dp[i][j][k] = INF; dp[0][0][0] = 0; for (int i = 0; i < N; i++) { for (int a = 0; a < 444; a++) { for (int b = 0; b < 444; b++) { dp[i+1][a+A[i]][b+B[i]] = min(dp[i+1][a+A[i]][b+B[i]], dp[i][a][b] + C[i]); dp[i+1][a][b] = min(dp[i+1][a][b], dp[i][a][b]); } } } int ans = INF; for (int i = 1; i < 444; i++) { for (int j = 1; j < 444; j++) { int g = __gcd(i, j); if (i/g == Ma && j/g == Mb) ans = min(ans, dp[N][i][j]); } } if (ans == INF) ans = -1; cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Mixing Experiment |
User | mayoko |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1217 Byte |
Status | AC |
Exec Time | 35 ms |
Memory | 34176 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 | 21 ms | 34176 KB |
sample_02.txt | AC | 20 ms | 34176 KB |
subtask_1_01.txt | AC | 21 ms | 34176 KB |
subtask_1_02.txt | AC | 20 ms | 34176 KB |
subtask_1_03.txt | AC | 21 ms | 34176 KB |
subtask_1_04.txt | AC | 23 ms | 34176 KB |
subtask_1_05.txt | AC | 24 ms | 34176 KB |
subtask_1_06.txt | AC | 26 ms | 34176 KB |
subtask_1_07.txt | AC | 28 ms | 34176 KB |
subtask_1_08.txt | AC | 28 ms | 34176 KB |
subtask_1_09.txt | AC | 30 ms | 34176 KB |
subtask_1_10.txt | AC | 32 ms | 34176 KB |
subtask_1_11.txt | AC | 34 ms | 34176 KB |
subtask_1_12.txt | AC | 35 ms | 34176 KB |
subtask_1_13.txt | AC | 35 ms | 34176 KB |
subtask_1_14.txt | AC | 35 ms | 34176 KB |
subtask_1_15.txt | AC | 35 ms | 34176 KB |
subtask_1_16.txt | AC | 35 ms | 34176 KB |
subtask_1_17.txt | AC | 35 ms | 34176 KB |
subtask_1_18.txt | AC | 35 ms | 34176 KB |