Submission #1121081

---

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;
  ll n,ma,mb;
  cin>>n>>ma>>mb;

  int cnst=4000;

  int dp[45][8005];
  rep(i,45)rep(j,8005)
    dp[i][j]=INF;

  rep(i,n){
    int a,b,c;
    cin>>a>>b>>c;
    int diff=a*mb-b*ma;
    dp[i+1][diff+cnst]=min(dp[i+1][diff+cnst],c);
    rep(j,8005){
      dp[i+1][j]=min(dp[i+1][j],dp[i][j]);
      if(j+diff<8005 && j+diff>=0)
         dp[i+1][j+diff]=min(dp[i+1][j+diff],dp[i][j]+c);
    }
  }
  if(dp[n][cnst]<INF)
    cout<<dp[n][cnst]<<endl;
  else
    cout<<-1<<endl;
}

Submission Info

Judge Result