Submission #2243419

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n)  RFOR(i,0,n)
#define VSORT(v) sort(v.begin(), v.end())
#define DVSORT(v) sort(v.begin(), v.end(),greater<int>())
#define SORT(v, n) sort(v, v+n)
#define DSORT(v,n) sort(v, v+n,greater<int>())
#define vi vector<int>
#define pb push_back
 
template <class T> void chmin(T&a,const T&b) { a = min(a,b); }
template <class T> void chmax(T&a,const T&b) { a = max(a,b); }
 
void print(){cout<<endl;}
template <class Head, class... Tail>
void print(Head&& h,Tail&&... t){ 
	if(sizeof...(t)==0)
		cout<<h;
	else
		cout<<h<<' ';
	print(move(t)...);
}
 
const double EPS =1e-9;
const long INF =2147483647;//32bit 2*1e+9
const long MOD =1e+9+7;
#define PI 3.14159265258979
#define P pair<int,int>
#define PPi pair<P,int>
 
int dy[]={0, 0, 1, -1, 1, 1, -1, -1};
int dx[]={1, -1, 0, 0, 1, -1, -1, 1};
const int MAX_V = 100;
const int MAX_E = 1000;

const int nmax=40,abmax=10;
int a[nmax],b[nmax],c[nmax];
int dp[nmax+1][nmax*abmax+1][nmax*abmax+1];

int main(void){
	cin.tie(0);
	ios_base::sync_with_stdio(false);

	int n,ma,mb;
	cin>>n>>ma>>mb;
	REP(i,n) cin>>a[i]>>b[i]>>c[i];

	REP(i,n+1)
		REP(j,nmax*abmax+1)
			REP(r,nmax*abmax+1)
				dp[i][j][r]=INF;

	dp[0][0][0]=0;
	
	REP(i,n){
		REP(j,nmax*abmax+1){
			REP(r,nmax*abmax+1){
				if(dp[i][j][r]==INF) continue; //INFなら更新の必要はないため
				chmin(dp[i+1][j][r],dp[i][j][r]); //i番目の商品を選ばない
				chmin(dp[i+1][j+a[i]][r+b[i]],dp[i][j][r]+c[i]); //i番目の商品を選ぶ
			}
		}
	}

	int result=INF;
	
	FOR(i,1,nmax*abmax+1)
		FOR(j,1,nmax*abmax+1)
			if(i*mb==j*ma) chmin(result,dp[n][i][j]);

	if(result==INF) print("-1");
	else print(result);

	return 0;
}

Submission Info

Judge Result