Submission #1104864

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;

int n, Ma, Mb;
int a[50], b[50], c[50];
int dp[50][500][500];

int main(void){
	cin >> n >> Ma >> Mb;
	rep(i, n) cin >> a[i] >> b[i] >> c[i];
	rep(i, 50)rep(j, 500)rep(k, 500)dp[i][j][k] = INF;
	dp[0][0][0] = 0;
	rep(i, n){
		rep(j, 20)rep(k, 20){
			if(dp[i][j][k] == INF) continue;
			//tukau
			chmin(dp[i + 1][j + a[i]][k + b[i]], dp[i][j][k] + c[i]);
			// printf("1 dp[%d][%d][%d] = %d\n", i, j, k, dp[i][j][k]);
			// printf("2 dp[%d][%d][%d] = %d\n", i + 1, j + a[i], k + b[i], dp[i + 1][j + a[i]][k + b[i]]);
			chmin(dp[i + 1][j][k], dp[i][j][k]);
		}
	}

	int ans = INF;
	reps(i, 1, 50){
		int A = Ma * i, B = Mb * i;
		if(A > 490 || B > 490) break;
		chmin(ans, dp[n][A][B]);
	}
	if(ans == INF) printf("-1\n");
	else printf("%d\n", ans);
	return 0;
}

Submission Info

Judge Result