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

#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using i128 = boost::multiprecision::int128_t;
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using Vbo = vector<bool>;
using VV = vector<V>;
using VVll = vector<Vll>;
using VVld = vector<Vld>;
using VVbo = vector<Vbo>;
using VVV = vector<VV>;
using VVVll = vector<VVll>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using Pld = pair<ld, ld>;
#define rep2(i, m, n) for (int i = int(m); i < int(n); ++i)
#define drep2(i, m, n) for (int i = int(m) - 1; i >= int(n); --i)
#define rep(i, n) rep2(i, 0, n)
#define drep(i, n) drep2(i, n, 0)
#define all(a) a.begin(), a.end()
struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  };
} fast_ios_;
template <typename T> inline int sz(T &x) { return x.size(); }
template <typename T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  for (auto &e : v)
    is >> e;
  return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
  for (auto &e : v)
    os << e << "\\n";
  return os;
}
template <typename T> inline int count_between(vector<T> &a, T l, T r) {
  return lower_bound(all(a), r) - lower_bound(all(a), l);
} // [l, r)
inline int fLog2(const int x) {
  return 31 - __builtin_clz(x);
} // floor(log2(x))
inline int fLog2(const ll x) { return 63 - __builtin_clzll(x); }
inline int cLog2(const int x) {
  return (x == 1) ? 0 : 32 - __builtin_clz(x - 1);
} // ceil(log2(x))
inline int cLog2(const ll x) {
  return (x == 1) ? 0 : 64 - __builtin_clzll(x - 1);
}
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
const int INF = 1 << 30;
const ll INFll = 1ll << 62;
const ld EPS = 1e-10;
const ld PI = acos(-1.0);
const int MOD = int(1e9) + 7;
// const int MOD  = 998244353;

int pen(int x, int y) {
  int z = y - x - 1;
  return z * (z + 1) / 2;
}

int main() {
  int D;
  cin >> D;
  const int M = 26;
  V c(M);
  cin >> c;
  VV s(D, V(M));
  cin >> s;

  vector<set<int>> held(M, {0, D + 1});
  set<int> tbd;
  rep2(i, 1, D + 1) tbd.insert(i);
  V ans(D);

  rep(_, D) {
    P am;
    int cm = 0;
    for (auto d : tbd) {
      int am2 = 0;
      int cm2 = 0;
      rep(i, M) {
        int res = 0;
        auto it = held[i].lower_bound(d);
        int r = *it;
        --it;
        int l = *it;
        res += pen(l, d);
        res += pen(d, r);
        res -= pen(l, r);
        res *= c[i];
        res -= s[d - 1][i];
        if (chmin(cm2, res))
          am2 = i;
      }
      if (chmin(cm, cm2))
        am = {d, am2};
    }
    auto [x, y] = am;
    held[y].insert(x);
    tbd.erase(x);
    ans[x - 1] = y + 1;
  }

  const int T = 1e6;
  rep(_, T) {
    int d = rand() % D;
    held[ans[d] - 1].erase(d + 1);
    ++d;
    int am2 = 0;
    int cm2 = 0;
    rep(i, M) {
      int res = 0;
      auto it = held[i].lower_bound(d);
      int r = *it;
      --it;
      int l = *it;
      res += pen(l, d);
      res += pen(d, r);
      res -= pen(l, r);
      res *= c[i];
      res -= s[d - 1][i];
      if (chmin(cm2, res))
        am2 = i;
    }
    int x = d;
    int y = am2;
    held[y].insert(x);
    ans[x - 1] = y + 1;
    // rep(i, M) cout << (sz(held[i]) - 2) << ' ';
    // cout << '\\n';
  }

  cout << ans;
  return 0;
}


Error: TLE

Fixed submission:

#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using i128 = boost::multiprecision::int128_t;
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using Vbo = vector<bool>;
using VV = vector<V>;
using VVll = vector<Vll>;
using VVld = vector<Vld>;
using VVbo = vector<Vbo>;
using VVV = vector<VV>;
using VVVll = vector<VVll>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using Pld = pair<ld, ld>;
#define rep2(i, m, n) for (int i = int(m); i < int(n); ++i)
#define drep2(i, m, n) for (int i = int(m) - 1; i >= int(n); --i)
#define rep(i, n) rep2(i, 0, n)
#define drep(i, n) drep2(i, n, 0)
#define all(a) a.begin(), a.end()
struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  };
} fast_ios_;
template <typename T> inline int sz(T &x) { return x.size(); }
template <typename T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  for (auto &e : v)
    is >> e;
  return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
  for (auto &e : v)
    os << e << "\\n";
  return os;
}
template <typename T> inline int count_between(vector<T> &a, T l, T r) {
  return lower_bound(all(a), r) - lower_bound(all(a), l);
} // [l, r)
inline int fLog2(const int x) {
  return 31 - __builtin_clz(x);
} // floor(log2(x))
inline int fLog2(const ll x) { return 63 - __builtin_clzll(x); }
inline int cLog2(const int x) {
  return (x == 1) ? 0 : 32 - __builtin_clz(x - 1);
} // ceil(log2(x))
inline int cLog2(const ll x) {
  return (x == 1) ? 0 : 64 - __builtin_clzll(x - 1);
}
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
const int INF = 1 << 30;
const ll INFll = 1ll << 62;
const ld EPS = 1e-10;
const ld PI = acos(-1.0);
const int MOD = int(1e9) + 7;
// const int MOD  = 998244353;

int pen(int x, int y) {
  int z = y - x - 1;
  return z * (z + 1) / 2;
}

int main() {
  int D;
  cin >> D;
  const int M = 26;
  V c(M);
  cin >> c;
  VV s(D, V(M));
  cin >> s;

  vector<set<int>> held(M, {0, D + 1});
  set<int> tbd;
  rep2(i, 1, D + 1) tbd.insert(i);
  V ans(D);

  rep(_, D) {
    P am;
    int cm = 0;
    for (auto d : tbd) {
      int am2 = 0;
      int cm2 = 0;
      rep(i, M) {
        int res = 0;
        auto it = held[i].lower_bound(d);
        int r = *it;
        --it;
        int l = *it;
        res += pen(l, d);
        res += pen(d, r);
        res -= pen(l, r);
        res *= c[i];
        res -= s[d - 1][i];
        if (chmin(cm2, res))
          am2 = i;
      }
      if (chmin(cm, cm2))
        am = {d, am2};
    }
    auto [x, y] = am;
    held[y].insert(x);
    tbd.erase(x);
    ans[x - 1] = y + 1;
  }

  const int T = 1e6;
  rep(_, T) {
    int d = rand() % D;
    held[ans[d]].erase(d + 1);
    ++d;
    int am2 = 0;
    int cm2 = 0;
    rep(i, M) {
      int res = 0;
      auto it = held[i].lower_bound(d);
      int r = *it;
      --it;
      int l = *it;
      res += pen(l, d);
      res += pen(d, r);
      res -= pen(l, r);
      res *= c[i];
      res -= s[d - 1][i];
      if (chmin(cm2, res))
        am2 = i;
    }
    int x = d;
    int y = am2;
    held[y].insert(x);
    ans[x - 1] = y + 1;
  }

  cout << ans;
  return 0;
}