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

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <string>
#include <tuple>
#include <vector>

using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(x) x.begin(), x.end()
using P = pair<int, int>;
using lint = long long;
using ll = long long;
const lint inf = 1e18 + 7;
const int MOD = 1000000007;
int d;
int c[30] = {};
int s[370][30];
int num = 130000;
int koho = 5;
int calc(vector<int> const &t, vector<vector<int>> &last_list) {
  int res = 0;
  vector<int> last(30, 0);
  rep1(i, d) {
    res += s[i][t[i]];
    last[t[i]] = i;
    last_list[i] = last;
    int buf = 0;
    rep1(j, 26) { buf += c[j] * (i - last[j]); }
    res -= buf;
    // cout<<res<<"\\n";
  }
  return res;
}
int change(int nd, int nq, int &res, vector<int> &t,
           vector<vector<int>> &last_list) {
  int flag_t = false;
  int flag_q = false;
  int x = t[nd];
  t[nd] = 0;
  res += s[nd][nq];
  res -= s[nd][x];
  for (int i = nd; i <= d; ++i) {
    if (flag_t && flag_q)
      break;
    if (t[i] == x || flag_t)
      flag_t = true;
    else {
      res += c[x] * (i - last_list[i][x]);
      last_list[i][x] = last_list[i - 1][x];
      res -= c[x] * (i - last_list[i][x]);
    }
    if (t[i] == nq || flag_q)
      flag_q = true;
    else {
      res += c[nq] * (i - last_list[i][nq]);
      last_list[i][nq] = nd;
      res -= c[nq] * (i - last_list[i][nq]);
    }
  }
  t[nd] = nq;
  return res;
}
vector<int> greedy(int d, vector<vector<int>> &t_koho) {
  vector<int> res(d + 1, 0);
  vector<int> last(30, 0);
  rep1(i, d) {
    int mx = -inf;
    int mx_ind = 0;
    vector<P> kouho(26);
    rep1(j, 26) {
      int tmp = s[i][j];
      rep1(k, 26) {
        if (k == j)
          continue;
        tmp -= c[k] * (i - last[k]);
      }
      if (mx < tmp) {
        mx = tmp;
        mx_ind = j;
      }
      kouho[j - 1] = {tmp, j};
    }
    sort(kouho.begin(), kouho.end());
    reverse(ALL(kouho));
    rep(x, koho) { t_koho[i][x] = kouho[x].second; }
    last[mx_ind] = i;
    res[i] = mx_ind;
  }
  return res;
}
signed main() {
  cin >> d;
  rep1(i, 26) cin >> c[i];
  rep1(i, d) { rep1(j, 26) cin >> s[i][j]; }
  vector<vector<int>> t_koho(d + 5, vector<int>(koho + 5, 0));
  vector<int> t = greedy(d, t_koho);
  vector<vector<int>> last_list(d + 1, vector<int>(30, 0));
  int res = calc(t, last_list);
  // cout<<res<<"\\n";
  int param = 1;
  rep(xx, num) {
    random_device rand;
    mt19937 mt(rand());
    int dev = koho;
    if (xx > num / 2)
      dev /= 2;
    vector<int> nd(param);
    rep(i, param) {
      nd[i] = mt() % d;
      if (nd[i] == 0)
        ++nd[i];
    }
    vector<int> bq(param);
    rep(i, param) bq[i] = t[nd[i]];
    int bval = res;
    rep(i, param) {
      change(nd[i], t[nd[i] + 1], res, t, last_list);
      change(nd[i] + 1, bq[i], res, t, last_list);
    }
    int yakinamasi = mt() % 100;
    // if(yakinamasi<(20-(xx*30)/num)&&res+res/10000>bval)continue;
    if (bval > res) {
      rep(i, param) {
        change(nd[i] + 1, t[nd[i]], res, t, last_list);
        change(nd[i], bq[i], res, t, last_list);
      }
    }
  }
  rep1(i, d) { cout << t[i] << "\\n"; }
  // cout<<res<<"\\n";
  return 0;
}

Error: -11

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <string>
#include <tuple>
#include <vector>

using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(x) x.begin(), x.end()
using P = pair<int, int>;
using lint = long long;
using ll = long long;
const lint inf = 1e18 + 7;
const int MOD = 1000000007;
int d;
int c[30] = {};
int s[370][30];
int num = 60000;
int koho = 5;
int calc(vector<int> const &t, vector<vector<int>> &last_list) {
  int res = 0;
  vector<int> last(30, 0);
  rep1(i, d) {
    res += s[i][t[i]];
    last[t[i]] = i;
    last_list[i] = last;
    int buf = 0;
    rep1(j, 26) { buf += c[j] * (i - last[j]); }
    res -= buf;
    // cout<<res<<"\\n";
  }
  return res;
}
int change(int nd, int nq, int &res, vector<int> &t,
           vector<vector<int>> &last_list) {
  int flag_t = false;
  int flag_q = false;
  int x = t[nd];
  t[nd] = 0;
  res += s[nd][nq];
  res -= s[nd][x];
  for (int i = nd; i <= d; ++i) {
    if (flag_t && flag_q)
      break;
    if (t[i] == x || flag_t)
      flag_t = true;
    else {
      res += c[x] * (i - last_list[i][x]);
      last_list[i][x] = last_list[i - 1][x];
      res -= c[x] * (i - last_list[i][x]);
    }
    if (t[i] == nq || flag_q)
      flag_q = true;
    else {
      res += c[nq] * (i - last_list[i][nq]);
      last_list[i][nq] = nd;
      res -= c[nq] * (i - last_list[i][nq]);
    }
  }
  t[nd] = nq;
  return res;
}
vector<int> greedy(int d, vector<vector<int>> &t_koho) {
  vector<int> res(d + 1, 0);
  vector<int> last(30, 0);
  rep1(i, d) {
    int mx = -inf;
    int mx_ind = 0;
    vector<P> kouho(26);
    rep1(j, 26) {
      int tmp = s[i][j];
      rep1(k, 26) {
        if (k == j)
          continue;
        tmp -= c[k] * (i - last[k]);
      }
      if (mx < tmp) {
        mx = tmp;
        mx_ind = j;
      }
      kouho[j - 1] = {tmp, j};
    }
    sort(kouho.begin(), kouho.end());
    reverse(ALL(kouho));
    rep(x, koho) { t_koho[i][x] = kouho[x].second; }
    last[mx_ind] = i;
    res[i] = mx_ind;
  }
  return res;
}
signed main() {
  cin >> d;
  rep1(i, 26) cin >> c[i];
  rep1(i, d) { rep1(j, 26) cin >> s[i][j]; }
  vector<vector<int>> t_koho(d + 5, vector<int>(koho + 5, 0));
  vector<int> t = greedy(d, t_koho);
  vector<vector<int>> last_list(d + 1, vector<int>(30, 0));
  int res = calc(t, last_list);
  // cout<<res<<"\\n";
  int param = 2;
  rep(xx, num) {
    random_device rand;
    mt19937 mt(rand());
    int dev = koho;
    if (xx > num / 2)
      dev /= 2;
    vector<int> nd(param);
    rep(i, param) nd[i] = mt() % d;
    vector<int> bq(param);
    rep(i, param) bq[i] = t[nd[i]];
    int bval = res;
    rep(i, param) {
      change(nd[i], t[nd[i] + 1], res, t, last_list);
      change(nd[i] + 1, bq[i], res, t, last_list);
    }
    int yakinamasi = mt() % 100;
    // if(yakinamasi<(20-(xx*30)/num)&&res+res/10000>bval)continue;
    if (bval > res) {
      rep(i, param) {
        change(nd[i] + 1, t[nd[i]], res, t, last_list);
        change(nd[i], bq[i], res, t, last_list);
      }
    }
  }
  rep1(i, d) { cout << t[i] << "\\n"; }
  // cout<<res<<"\\n";
  return 0;
}