Submission #1757500

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<string>
#include<sstream>
#include<cmath>
#include<climits>
#include<algorithm>
#include<bitset>
#include<set>
#include<stack>
#include<queue>
#include<iomanip>
#include<memory.h>
#include<complex>
using namespace std;  
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef tuple<int,int> tii;
#define rep(i,n) for(ll i=0;i<(n);i++)  
#define pb push_back
#define mt make_tuple
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second  
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-8;
const double PI = M_PI;  
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define SHOWARRAY(ar,i,j) REP(a,i)REP(b,j)cerr<<ar[a][b]<<((b==j-1)?((a==i-1)?("\n\n"):("\n")):(" "))
#define DIV int(1e9+7)
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;}

/* Coding Space*/
using tiii = tuple<int,int,int>;
int ans = INF;

int n,ma,mb;
vector<tiii> v;

void dfs(int sum,int index,int now_ma,int now_mb){
  if(index == n) return;
  if(now_ma*mb == now_mb*ma && now_ma != 0){ans = min(ans,sum); return;}
  int a,b,c; tie(a,b,c) = v[index];
  dfs(sum+c,index+1,now_ma+a,now_mb+b);
  dfs(sum,index+1,now_ma,now_mb);
  return;
}

int main(){
  cin >> n >> ma >> mb;
  rep(i,n){int a,b,c; cin >> a >> b>> c; v.pb(tiii{a,b,c});}
  cout << (dfs(0,0,0,0),(ans == INF?-1:ans)) << endl;
}

Submission Info

Judge Result