Problem p03806 (C++)

Buggy submission (status: Runtime Error):
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;

// conversion
//------------------------------------------
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T> inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}

// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }

// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c)                                                             \
  for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())

// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)

// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);

// clear memory
#define CLR(a) memset((a), 0, sizeof(a))

// debug
#define dump(x) cerr << #x << '=' << (x) << endl;
#define debug(x)                                                               \
  cerr << #x << '=' << (x) << '(' << 'L' << __LINE__ << ')' << ' ' << __FILE__ \
       << endl;

const long INF = 114514810;
const int maxN = 40;
const int maxA = 400, maxB = 400;

template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}

// i番目の品物まででMa=a Mb=bとなる最小のお金テーブル
long dp[maxN][maxA][maxB];
int main() {
  Fill(dp, INF);
  dp[0][0][0] = 0;

  int N, Ma, Mb;
  cin >> N >> Ma >> Mb;
  VI As(N);
  VI Bs(N);
  VI Cs(N);
  REP(i, N) { cin >> As[i] >> Bs[i] >> Cs[i]; }

  REP(n, N) {
    REP(i, maxA) {
      REP(j, maxB) {
        if (dp[n][i][j] == INF) {
          continue;
        }
        dp[n + 1][i][j] =
            min(dp[n + 1][i][j], dp[n][i][j]); // n番目を使わない場合
        dp[n + 1][i + As[n]][j + Bs[n]] =
            min(dp[n + 1][i + As[n]][j + Bs[n]],
                dp[n][i][j] + Cs[n]); // n番目を使う場合
      }
    }
  }

  long ans = INF;
  FOR(i, 1, maxA + 1) FOR(j, 1, maxB + 1) {
    if (i * Mb == j * Ma) {
      ans = min(ans, dp[N][i][j]);
    }
  }
  if (ans == INF) {
    ans = -1;
  }
  cout << ans << endl;
}


Fixed submission:
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;

// conversion
//------------------------------------------
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T> inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}

// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }

// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c)                                                             \
  for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())

// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)

// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);

// clear memory
#define CLR(a) memset((a), 0, sizeof(a))

// debug
#define dump(x) cerr << #x << '=' << (x) << endl;
#define debug(x)                                                               \
  cerr << #x << '=' << (x) << '(' << 'L' << __LINE__ << ')' << ' ' << __FILE__ \
       << endl;

const long INF = 114514810;
const int maxN = 40;
const int maxA = 400, maxB = 400;

template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}

// i番目の品物まででMa=a Mb=bとなる最小のお金テーブル
long dp[maxN + 1][maxA + 1][maxB + 1];
int main() {
  Fill(dp, INF);
  dp[0][0][0] = 0;

  int N, Ma, Mb;
  cin >> N >> Ma >> Mb;
  VI As(N);
  VI Bs(N);
  VI Cs(N);
  REP(i, N) { cin >> As[i] >> Bs[i] >> Cs[i]; }

  REP(n, N) {
    REP(i, maxA) {
      REP(j, maxB) {
        if (dp[n][i][j] == INF) {
          continue;
        }
        dp[n + 1][i][j] =
            min(dp[n + 1][i][j], dp[n][i][j]); // n番目を使わない場合
        dp[n + 1][i + As[n]][j + Bs[n]] =
            min(dp[n + 1][i + As[n]][j + Bs[n]],
                dp[n][i][j] + Cs[n]); // n番目を使う場合
      }
    }
  }

  long ans = INF;
  FOR(i, 1, maxA + 1) FOR(j, 1, maxB + 1) {
    if (i * Mb == j * Ma) {
      ans = min(ans, dp[N][i][j]);
    }
  }
  if (ans == INF) {
    ans = -1;
  }
  cout << ans << endl;
}