Problem p01719 (C++) — buggy submission, verdict: Runtime Error

#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
// #define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define CLR(a) memset((a), 0, sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};

struct UnionFind {
  vector<int> v;
  UnionFind(int n) : v(n) {
    for (int i = 0; i < n; i++)
      v[i] = i;
  }
  int find(int x) { return v[x] == x ? x : v[x] = find(v[x]); }
  void unite(int x, int y) { v[find(x)] = find(y); }
};

int main() {
  int n, d, x;
  cin >> n >> d >> x;
  vvi val(d, vi(n));
  REP(i, d)
  REP(j, n)
  cin >> val[i][j];
  vvi dp(d, vi(100001));
  REP(i, x + 1) { dp[0][i] = i; }
  int ma = x;
  int tmp;
  FOR(i, 1, d) {
    tmp = 0;
    REP(k, ma + 1)
    dp[i][k] = k;
    REP(k, ma + 1) {
      REP(j, n)
      if (k - val[i - 1][j] >= 0) {
        dp[i][k] = max(dp[i][k], dp[i][k - val[i - 1][j]] + val[i][j]);
        tmp = max(tmp, dp[i][k]);
      }
    }
    ma = max(ma, tmp);
  }
  int ans = 0;
  REP(i, dp[d - 1].size())
  ans = max(ans, dp[d - 1][i]);
  cout << ans << endl;
}

Error: 0

Fixed submission:

#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
// #define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define CLR(a) memset((a), 0, sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};

struct UnionFind {
  vector<int> v;
  UnionFind(int n) : v(n) {
    for (int i = 0; i < n; i++)
      v[i] = i;
  }
  int find(int x) { return v[x] == x ? x : v[x] = find(v[x]); }
  void unite(int x, int y) { v[find(x)] = find(y); }
};

int main() {
  int n, d, x;
  cin >> n >> d >> x;
  vvi val(d, vi(n));
  REP(i, d)
  REP(j, n)
  cin >> val[i][j];
  vvi dp(d, vi(10001));
  REP(i, x + 1) { dp[0][i] = i; }
  int ma = x;
  int tmp;
  FOR(i, 1, d) {
    tmp = 0;
    REP(k, ma + 1)
    dp[i][k] = k;
    REP(k, ma + 1) {
      REP(j, n)
      if (k - val[i - 1][j] >= 0) {
        dp[i][k] = max(dp[i][k], dp[i][k - val[i - 1][j]] + val[i][j]);
        tmp = max(tmp, dp[i][k]);
      }
    }
    ma = max(ma, tmp);
  }
  int ans = 0;
  REP(i, dp[d - 1].size())
  ans = max(ans, dp[d - 1][i]);
  cout << ans << endl;
}