Submission #1103816

---

Source Code Expand

#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#include <random>
#include <unordered_set>
#include <complex>
using namespace std;
 
#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };
// typedef complex<double> C;
 
ll MOD = 1000000007;
ll _MOD = 1000000009;
int INF = INT_MAX / 2;
double EPS = 1e-10;

int main() {
	int N, A, B;
	cin >> N >> A >> B;
	vector<vector<int> > dp(401, vector<int>(401, INF));
	dp[0][0] = 0;
	while (N--) {
		int a, b, c;
		cin >> a >> b >> c;
		for (int x = 400; x >= a; x--)
			for (int y = 400; y >= b; y--)
				dp[x][y] = min(dp[x][y], dp[x - a][y - b] + c);
	}
	int ans = INF;
	for (int x = 1; x <= 400; x++)
		for (int y = 1; y <= 400; y++)
			if (x * B == y * A)
				ans = min(ans, dp[x][y]);
	if (ans == INF) ans = -1;
	cout << ans << endl;
}

Submission Info

Judge Result