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

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#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;

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();
}
template <class T> inline T sqr(T x) { return x * x; }

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#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 range(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) range(i, 0, n)
#define clr(a, b) memset((a), (b), sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x)                                                               \\
  cerr << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \\
       << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi = acos(-1.0);
const ll INF = 1LL << 62;
const int inf = 1 << 29;

const int N = 101;

int main(void) {
  for (int T, res; cin >> T, T;) {
    vi t(T);
    rep(i, T) cin >> t[i];

    int n;
    cin >> n;
    vi m(N, 23);
    rep(i, n) {
      int D, M;
      cin >> D >> M;
      D--;
      m[D] = min(m[D], M);
    }

    vvi dp(N, vi(T, inf));
    dp[0][0] = 0;
    range(i, 1, N) {
      rep(j, T) {
        if (dp[i - 1][j] == inf)
          continue;

        dp[i][0] = min(dp[i][0], dp[i - 1][j] + 1);

        int nextT = (j + 1) % T;
        if (0 <= m[i] - t[nextT]) {
          dp[i][nextT] = min(dp[i][nextT], dp[i - 1][j]);
        }
      }
    }

    cout << *min_element(all(dp[N - 1])) << endl;
  }

  return 0;
}

Error: 0

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#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;

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();
}
template <class T> inline T sqr(T x) { return x * x; }

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#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 range(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) range(i, 0, n)
#define clr(a, b) memset((a), (b), sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x)                                                               \\
  cerr << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \\
       << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi = acos(-1.0);
const ll INF = 1LL << 62;
const int inf = 1 << 29;

int main(void) {
  for (int T, res; cin >> T, T;) {
    vi t(T);
    rep(i, T) cin >> t[i];

    int n;
    cin >> n;
    vi m(n, 23);
    rep(i, n) {
      int D, M;
      cin >> D >> M;
      D--;
      m[D] = min(m[D], M);
    }

    vvi dp(n, vi(T, inf));
    dp[0][0] = 0;
    range(i, 1, n) {
      rep(j, T) {
        if (dp[i - 1][j] == inf)
          continue;

        dp[i][0] = min(dp[i][0], dp[i - 1][j] + 1);

        int nextT = (j + 1) % T;
        if (0 <= m[i] - t[nextT]) {
          dp[i][nextT] = min(dp[i][nextT], dp[i - 1][j]);
        }
      }
    }

    cout << *min_element(all(dp[n - 1])) << endl;
  }

  return 0;
}