Submission #1103993

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pi M_PI
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
typedef pair<P,int> PP;

void Main() {
  int n,s,t;
  cin >> n >> s >> t;
  PP a[n];
  rep(i,n) cin >> a[i].F.F >> a[i].F.S >> a[i].S;
  int dp[1000][1000];
  rep(i,1000)rep(j,1000) dp[i][j]=MAX;
  dp[0][0]=0;
  rep(i,n)rrep(j,1000)rrep(k,1000) {
    if(j+a[i].F.F<1000&&k+a[i].F.S<1000) dp[j+a[i].F.F][k+a[i].F.S]=min(dp[j+a[i].F.F][k+a[i].F.S],dp[j][k]+a[i].S);
  }
  int ans=MAX;
  REP(i,1,1000)REP(j,1,1000) {
    ll d=__gcd(i,j);
    ll x=i/d,y=j/d;
    if(x==s&&y==t) ans=min(ans,dp[i][j]);
  }
  if(ans==MAX) ans=-1;
  pr(ans);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}

Submission Info

Judge Result