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

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (n); ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<P>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
template <class S, class T> istream &operator>>(istream &is, pair<S, T> &p) {
  return is >> p.first >> p.second;
}
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
  return os << '{' << p.first << "," << p.second << '}';
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
  for (T &t : v) {
    is >> t;
  }
  return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  os << '[';
  rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? ']' : ',');
  return os;
}
void Yes(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YES(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T> bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
const int inf = 1001001001;
const ll linf = 1001001001001001001;

int D;
vi c(26);
vvi s;
vvi last;
vi v;
vvi Next;

int calc(int num = D) {
  rep(i, D) last[i].assign(26, -1);
  int ret = 0;
  rep(i, num) {
    ret += s[i][v[i]];
    if (i > 0)
      last[i] = last[i - 1];
    last[i][v[i]] = i;
    rep(j, 26) ret -= c[j] * (i - last[i][j]);
  }
  return ret;
}

int dif(int d, int q) {
  int ol_q = v[d];
  int ol_last = (d == 0 ? -1 : last[d - 1][ol_q]);
  int new_last = last[d][q];
  int ret = s[d][q] - s[d][ol_q];
  ret -= c[ol_q] * (d - ol_last) * (Next[d][ol_q] - d);
  ret += c[q] * (d - new_last) * (Next[d][q] - d);
  return ret;
}

void change(int d, int q) {
  int ol_q = v[d];
  int ol_last = (d == 0 ? -1 : last[d - 1][ol_q]);
  int ol_next = (d == D - 1 ? D : Next[d + 1][ol_q]);
  int new_last = last[d][q];
  int new_next = Next[d][q];
  rep2(i, d, D) {
    if (last[i][ol_q] > d)
      break;
    last[i][ol_q] = ol_last;
  }
  rrep(i, d + 1) {
    if (Next[i][ol_q] < d)
      break;
    Next[i][ol_q] = ol_next;
  }
  rep2(i, d, D) {
    if (last[i][q] > new_last)
      break;
    last[i][q] = d;
  }
  rrep(i, d + 1) {
    if (Next[i][q] < new_next)
      break;
    Next[i][q] = d;
  }
  v[d] = q;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  //    ifstream in("../input.txt");
  //    cin.rdbuf(in.rdbuf());
  clock_t START = clock();
  cin >> D;
  s.resize(D);
  last.resize(D);
  v.resize(D);
  Next.resize(D);
  rep(i, D) s[i].resize(26);
  rep(i, D) Next[i].resize(26);
  cin >> c >> s;
  rep(i, D) {
    int mx = -inf;
    int now = -1;
    rep(j, 26) {
      v[i] = j;
      int temp = calc(i + 1);
      if (temp > mx) {
        mx = temp;
        now = j;
      } else {
        v[i] = now;
      }
    }
  }
  rrep(i, D) {
    if (i == D - 1)
      Next[i] = vi(26, D);
    else
      Next[i] = Next[i + 1];
    Next[i][v[i]] = i;
  }
  random_device rnd;
  mt19937 mt(rnd());
  while (double(clock() - START) / CLOCKS_PER_SEC * 1000 <= 1950) {
    int nd = mt() % D, nq = mt() % 26;
    if (dif(nd, nq) >= 0)
      change(nd, nq);
  }
  rep(i, D) cout << v[i] + 1 << "\\n";
}


Error: -11

Fixed submission:

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (n); ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<P>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
template <class S, class T> istream &operator>>(istream &is, pair<S, T> &p) {
  return is >> p.first >> p.second;
}
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
  return os << '{' << p.first << "," << p.second << '}';
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
  for (T &t : v) {
    is >> t;
  }
  return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  os << '[';
  rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? ']' : ',');
  return os;
}
void Yes(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YES(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T> bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
const int inf = 1001001001;
const ll linf = 1001001001001001001;

int D;
vi c(26);
vvi s;
vvi last;
vi v;
vvi Next;

int calc(int num = D) {
  rep(i, D) last[i].assign(26, -1);
  int ret = 0;
  rep(i, num) {
    ret += s[i][v[i]];
    if (i > 0)
      last[i] = last[i - 1];
    last[i][v[i]] = i;
    rep(j, 26) ret -= c[j] * (i - last[i][j]);
  }
  return ret;
}

int dif(int d, int q) {
  int ol_q = v[d];
  int ol_last = (d == 0 ? -1 : last[d - 1][ol_q]);
  int new_last = last[d][q];
  int ret = s[d][q] - s[d][ol_q];
  ret -= c[ol_q] * (d - ol_last) * (Next[d][ol_q] - d);
  ret += c[q] * (d - new_last) * (Next[d][q] - d);
  return ret;
}

void change(int d, int q) {
  int ol_q = v[d];
  int ol_last = (d == 0 ? -1 : last[d - 1][ol_q]);
  int ol_next = (d == D - 1 ? D : Next[d + 1][ol_q]);
  int new_last = last[d][q];
  int new_next = Next[d][q];
  rep2(i, d, D) {
    if (last[i][ol_q] > d)
      break;
    last[i][ol_q] = ol_last;
  }
  rrep(i, D + 1) {
    if (Next[i][ol_q] < d)
      break;
    Next[i][ol_q] = ol_next;
  }
  rep2(i, d, D) {
    if (last[i][q] > new_last)
      break;
    last[i][q] = d;
  }
  rrep(i, D + 1) {
    if (Next[i][q] < new_next)
      break;
    Next[i][q] = d;
  }
  v[d] = q;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  //    ifstream in("../input.txt");
  //    cin.rdbuf(in.rdbuf());
  clock_t START = clock();
  cin >> D;
  s.resize(D);
  last.resize(D);
  v.resize(D);
  Next.resize(D);
  rep(i, D) s[i].resize(26);
  rep(i, D) Next[i].resize(26);
  cin >> c >> s;
  rep(i, D) {
    int mx = -inf;
    int now = -1;
    rep(j, 26) {
      v[i] = j;
      int temp = calc(i + 1);
      if (temp > mx) {
        mx = temp;
        now = j;
      } else {
        v[i] = now;
      }
    }
  }
  rrep(i, D) {
    if (i == D - 1)
      Next[i] = vi(26, D);
    else
      Next[i] = Next[i + 1];
    Next[i][v[i]] = i;
  }
  random_device rnd;
  mt19937 mt(rnd());
  while (double(clock() - START) / CLOCKS_PER_SEC * 1000 <= 1950) {
    int nd = mt() % D, nq = mt() % 26;
    if (dif(nd, nq) >= 0)
      change(nd, nq);
  }
  rep(i, D) cout << v[i] + 1 << "\\n";
}