Submission #1123367

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
 
using namespace std;
 
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
 
typedef vector<int> vi;
typedef pair<int,int> pii;
 
int main(void) {
  int i,j,k;
  int n,ma,mb;
  cin>>n>>ma>>mb;
  int dp[45][405][405]; 
  rep(i,45)rep(j,405)rep(k,405)
    dp[i][j][k]=INF;
  dp[0][0][0]=0;
 
  rep(i,n){
    int a,b,c;
    cin>>a>>b>>c;
    rep(j,405)rep(k,405)
      if(dp[i][j][k]<INF){
        dp[i+1][j][k]=min(dp[i+1][j][k],dp[i][j][k]);
        if(j+a<405 && k+b<405)
          dp[i+1][j+a][k+b]=min(dp[i+1][j+a][k+b],dp[i][j][k]+c);
     }
  }
 
  int ans=INF;
  for(i=1;i*max(ma,mb)<405;i++)
    ans=min(ans,dp[n][i*ma][i*mb]);
  if(ans<INF)
    cout<<ans<<endl;
  else
    cout<<-1<<endl;
}

Submission Info

Judge Result