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

#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rp(i, c) rep(i, (int)c.size())
#define fr(i, c)                                                               \\
  for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define mp make_pair
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define rall(u) (u).rbegin(), (u).rend()
#define dbg(x) cerr << #x << " = " << (x) << endl
#define v_delete(a, b) (a).erase(remove((a).begin(), (a).end(), b), (a).end())
#define v_unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define VV(T) vector<vector<T>>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = 1 << 28;
const double EPS = 1e-9;
const long long INF = 100001000010000100ll;

template <class T> int SIZE(T a) { return a.size(); }
template <class T> string IntToString(T num) {
  string res;
  stringstream ss;
  ss << num;
  return ss.str();
}
template <class T> T StringToInt(string str) {
  T res = 0;
  for (int i = 0; i < SIZE(str); i++)
    res = (res * 10 + str[i] - '0');
  return res;
}
template <class T> T gcd(T a, T b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

template <class T> void input(T &a, int n) {
  for (int i = 0; i < n; ++i)
    cin >> a[i];
}
template <class T> void input(T *a, int n) {
  for (int i = 0; i < n; ++i)
    cin >> a[i];
}
typedef pair<int, int> pii;

int N;

int dp[2][2][10010];
const int A = 0;

vi l;

void rec(int i, int A, int w, int k) {}

int main() {
  cin >> N;
  l.pb(0);
  rep(i, N - 1) {
    int t;
    cin >> t;
    l.pb(t);
  }
  fill_n(**dp, 2 * 2 * 10010, inf);
  dp[0][A][0] = 0;
  for (int i = 1; i <= N; i++) {
    for (int w = 1; w <= i; w++) {
      dp[i & 1][A][w] =
          min(dp[(i - 1) & 1][A][w - 1], dp[(i - 1) & 1][!A][w - 1] + l[i - 1]);
      dp[i & 1][!A][w] =
          min(dp[(i - 1) & 1][!A][w], dp[(i - 1) & 1][A][w] + l[i - 1]);
    }
    dp[i & 1][A][0] = inf;
  }
  cout << min(dp[(N) % 2][A][N / 2], dp[(N) % 2][!A][N / 2]) << endl;
}

Error: 0

Fixed submission:

#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rp(i, c) rep(i, (int)c.size())
#define fr(i, c)                                                               \\
  for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define mp make_pair
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define rall(u) (u).rbegin(), (u).rend()
#define dbg(x) cerr << #x << " = " << (x) << endl
#define v_delete(a, b) (a).erase(remove((a).begin(), (a).end(), b), (a).end())
#define v_unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define VV(T) vector<vector<T>>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = 1 << 28;
const double EPS = 1e-9;
const long long INF = 100001000010000100ll;

template <class T> int SIZE(T a) { return a.size(); }
template <class T> string IntToString(T num) {
  string res;
  stringstream ss;
  ss << num;
  return ss.str();
}
template <class T> T StringToInt(string str) {
  T res = 0;
  for (int i = 0; i < SIZE(str); i++)
    res = (res * 10 + str[i] - '0');
  return res;
}
template <class T> T gcd(T a, T b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

template <class T> void input(T &a, int n) {
  for (int i = 0; i < n; ++i)
    cin >> a[i];
}
template <class T> void input(T *a, int n) {
  for (int i = 0; i < n; ++i)
    cin >> a[i];
}
typedef pair<int, int> pii;

int N;

int dp[101][2][10010];
const int A = 0;

vi l;

void rec(int i, int A, int w, int k) {}

int main() {
  cin >> N;
  l.pb(0);
  rep(i, N - 1) {
    int t;
    cin >> t;
    l.pb(t);
  }
  REP(i, 0, 101) {
    rep(j, 10010) {
      dp[i][0][j] = inf;
      dp[i][1][j] = inf;
    }
  }
  dp[0][0][0] = 0;
  dp[0][1][0] = 0;
  for (int i = 1; i <= N; i++) {
    for (int w = 0; w <= i; w++) {
      if (w > 0)
        dp[i][A][w] = min(dp[i - 1][A][w - 1], dp[i - 1][!A][w - 1] + l[i - 1]);
      dp[i][!A][w] = min(dp[i - 1][!A][w], dp[i - 1][A][w] + l[i - 1]);
    }
  }
  cout << min(dp[N][A][N / 2], dp[N][!A][N / 2]) << endl;
}