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

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x " = " << x << endl
#define print(x) cout << x << endl
#define maxch(x, y) x = max(x, y)
#define minch(x, y) x = min(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<int, P> PIP;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;
typedef set<int> S;

#define INF INT_MAX / 3
#define MAX_N 1000000001

ll dp[20001][256];

int main() {
  cin.sync_with_stdio(false);
  int n, m;
  while (cin >> n >> m, n | m) {
    vector<int> c(m), x(n);
    rep(i, m) cin >> c[i];
    rep(i, n) cin >> x[i];

    rep(i, n + 1) rep(j, 256) dp[i][j] = INF;
    dp[0][128] = 0;
    rep(i, n) {
      rep(j, 256) {
        if (dp[i][j] < INF) {
          rep(k, m) {
            int tmp = j + c[k];
            if (tmp > 255)
              tmp = 255;
            else if (tmp < 0)
              tmp = 0;
            minch(dp[i + 1][tmp], dp[i][j] + (x[i] - tmp) * (x[i] - tmp));
          }
        }
      }
    }

    ll ans = INF;
    rep(i, 256) minch(ans, dp[n][i]);

    cout << ans << endl;
  }

  return 0;
}

Error: -11

Fixed submission:

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x " = " << x << endl
#define print(x) cout << x << endl
#define maxch(x, y) x = max(x, y)
#define minch(x, y) x = min(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<int, P> PIP;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;
typedef set<int> S;

#define INF INT_MAX / 3
#define MAX_N 1000000001

int main() {
  cin.sync_with_stdio(false);
  int n, m;
  ll dp[20001][256];
  while (cin >> n >> m, n | m) {
    vector<int> c(m), x(n);
    rep(i, m) cin >> c[i];
    rep(i, n) cin >> x[i];

    rep(i, n + 1) rep(j, 256) dp[i][j] = INF;
    dp[0][128] = 0;
    rep(i, n) {
      rep(j, 256) {
        if (dp[i][j] < INF) {
          rep(k, m) {
            int tmp = j + c[k];
            if (tmp > 255)
              tmp = 255;
            else if (tmp < 0)
              tmp = 0;
            minch(dp[i + 1][tmp], dp[i][j] + (x[i] - tmp) * (x[i] - tmp));
          }
        }
      }
    }

    ll ans = INF;
    rep(i, 256) minch(ans, dp[n][i]);

    cout << ans << endl;
  }

  return 0;
}