Problem p02538 (C++) — buggy submission, verdict: Time Limit Exceeded

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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for (auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL << (n))
#define F first
#define S second
// functions
template <typename T> void unique(T &c) {
  c.erase(std::unique(c.begin(), c.end()), c.end());
}
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (auto &v : vec)
    is >> v;
  return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  for (int i = 0; i < vec.size(); i++) {
    os << vec[i];
    if (i + 1 != vec.size())
      os << " ";
  }
  return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
  for (auto itr = st.begin(); itr != st.end(); ++itr) {
    os << *itr;
    auto titr = itr;
    if (++titr != st.end())
      os << " ";
  }
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &st) {
  for (auto itr = st.begin(); itr != st.end(); ++itr) {
    os << *itr;
    auto titr = itr;
    if (++titr != st.end())
      os << " ";
  }
  return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
  for (auto itr = st.begin(); itr != st.end(); ++itr) {
    os << *itr;
    auto titr = itr;
    if (++titr != st.end())
      os << " ";
  }
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &st) {
  for (auto itr = st.begin(); itr != st.end(); ++itr) {
    os << *itr;
    auto titr = itr;
    if (++titr != st.end())
      os << " ";
  }
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
  for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
    os << "(" << itr->first << ", " << itr->second << ")";
    auto titr = itr;
    if (++titr != mp.end())
      os << " ";
  }
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp) {
  for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
    os << "(" << itr->first << ", " << itr->second << ")";
    auto titr = itr;
    if (++titr != mp.end())
      os << " ";
  }
  return os;
}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 60;
const double EPS = 1e-10;
const int mod = 998244353;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io {
  fast_io() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
  }
} fast_io_;

template <typename Monoid> class LazySegmentTree {
public:
  using T = typename Monoid::value_type;
  using E = typename Monoid::lazy_type;
  int n;
  T identity;
  E lazy_def;
  vector<T> val;
  vector<E> lazy;

  LazySegmentTree() {}
  LazySegmentTree(int n_, vector<T> v = vector<T>()) {
    identity = Monoid::identity;
    lazy_def = Monoid::lazy_def;
    n = 1;
    while (n < n_)
      n *= 2;
    val.assign(2 * n - 1, identity);
    lazy.assign(2 * n - 1, lazy_def);

    for (size_t i = 0; i < v.size(); i++) {
      val[i + n - 1] = v[i];
    }
    for (int i = n - 2; i >= 0; i--) {
      val[i] = Monoid::operation(val[2 * i + 1], val[2 * i + 2]);
    }
  }
  void eval(int k, int len) {
    if (lazy[k] == lazy_def)
      return;
    if (k < n - 1) {
      lazy[2 * k + 1] = Monoid::lazy_accumulate(lazy[2 * k + 1], lazy[k]);
      lazy[2 * k + 2] = Monoid::lazy_accumulate(lazy[2 * k + 2], lazy[k]);
    }
    val[k] = Monoid::lazy_update(val[k], lazy[k], len);
    lazy[k] = lazy_def;
  }
  T update(int a, int b, E &e, int k, int l, int r) {
    eval(k, r - l);
    if (r <= a || b <= l)
      return val[k];
    else if (a <= l && r <= b) {
      lazy[k] = Monoid::lazy_accumulate(lazy[k], e);
      eval(k, r - l);
      return val[k];
    } else {
      T lv = update(a, b, e, 2 * k + 1, l, (l + r) / 2);
      T rv = update(a, b, e, 2 * k + 2, (l + r) / 2, r);
      return val[k] = Monoid::operation(lv, rv);
    }
  }
  T update(int a, int b, E e) { return update(a, b, e, 0, 0, n); }
  T query(int a, int b, int k, int l, int r) {
    eval(k, r - l);
    if (r <= a || b <= l)
      return identity;
    if (a <= l && r <= b)
      return val[k];
    T lv = query(a, b, 2 * k + 1, l, (l + r) / 2);
    T rv = query(a, b, 2 * k + 2, (l + r) / 2, r);
    return Monoid::operation(lv, rv);
  }
  T query(int a, int b) { return query(a, b, 0, 0, n); }
  T get(int i) { return query(i, i + 1); }
};

template <typename T> T power(T a, T n, T mod) {
  T res = 1;
  T tmp = n;
  T curr = a;
  while (tmp) {
    if (tmp % 2 == 1) {
      res = (T)(res * curr % mod);
    }
    curr = (T)(curr * curr % mod);
    tmp >>= 1;
  }

  return res;
}

ll po[200010];
ll ni = 1;

class RUQ {
public:
  using value_type = pair<ll, ll>;
  using lazy_type = ll;
  using T = pair<ll, ll>;
  using E = ll;
  const static T identity;
  const static E lazy_def;
  RUQ() {}
  static T operation(T &l, T &r) {
    return mk((l.first * po[r.second] % mod + r.first) % mod,
              l.second + r.second);
  }
  static E lazy_accumulate(E &l, E &r) { return r; }
  static T lazy_update(T &t, E &e, int len) {
    ll s = (po[len] - 1) * ni % mod;
    s = s * e % mod;
    if (s < 0)
      s += mod;
    return mk(s, len);
  }
};

const pair<ll, ll> RUQ::identity = mk(0, 0);
const ll RUQ::lazy_def = numeric_limits<ll>::min();

int main(int argc, char const *argv[]) {
  int n, q;
  cin >> n >> q;
  po[0] = 1;
  FOR(i, 1, 200010) po[i] = po[i - 1] * 10LL % mod;
  ni = power<ll>(9, mod - 2, mod);
  vector<pair<ll, ll>> v(n, mk(1, 1));
  LazySegmentTree<RUQ> seg(n, v);
  rep(i, q) {
    /*
    rep(j, seg.val.size()){
      if(j == 1 || j == 3 || j == 7)cerr << endl;
      cerr << seg.val[j] << " ";
    }
    cerr << endl;
    rep(j, seg.val.size()){
      if(j == 1 || j == 3 || j == 7)cerr << endl;
      cerr << seg.lazy[j] << " ";
    }
    cerr << endl;
    */
    int l, r, d;
    cin >> l >> r >> d;
    l--;
    r--;
    seg.update(l, r + 1, d);
    cout << seg.query(0, n).first << "\\n";
  }
  cout << flush;
  return 0;
}


Error: TLE

Fixed submission:

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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for (auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL << (n))
#define F first
#define S second
// functions
template <typename T> void unique(T &c) {
  c.erase(std::unique(c.begin(), c.end()), c.end());
}
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (auto &v : vec)
    is >> v;
  return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  for (int i = 0; i < vec.size(); i++) {
    os << vec[i];
    if (i + 1 != vec.size())
      os << " ";
  }
  return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
  for (auto itr = st.begin(); itr != st.end(); ++itr) {
    os << *itr;
    auto titr = itr;
    if (++titr != st.end())
      os << " ";
  }
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &st) {
  for (auto itr = st.begin(); itr != st.end(); ++itr) {
    os << *itr;
    auto titr = itr;
    if (++titr != st.end())
      os << " ";
  }
  return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
  for (auto itr = st.begin(); itr != st.end(); ++itr) {
    os << *itr;
    auto titr = itr;
    if (++titr != st.end())
      os << " ";
  }
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &st) {
  for (auto itr = st.begin(); itr != st.end(); ++itr) {
    os << *itr;
    auto titr = itr;
    if (++titr != st.end())
      os << " ";
  }
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
  for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
    os << "(" << itr->first << ", " << itr->second << ")";
    auto titr = itr;
    if (++titr != mp.end())
      os << " ";
  }
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp) {
  for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
    os << "(" << itr->first << ", " << itr->second << ")";
    auto titr = itr;
    if (++titr != mp.end())
      os << " ";
  }
  return os;
}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 60;
const double EPS = 1e-10;
const int mod = 998244353;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io {
  fast_io() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
  }
} fast_io_;

template <typename Monoid> class LazySegmentTree {
public:
  using T = typename Monoid::value_type;
  using E = typename Monoid::lazy_type;
  int n;
  T identity;
  E lazy_def;
  vector<T> val;
  vector<E> lazy;

  LazySegmentTree() {}
  LazySegmentTree(int n_, vector<T> v = vector<T>()) {
    identity = Monoid::identity;
    lazy_def = Monoid::lazy_def;
    n = 1;
    while (n < n_)
      n *= 2;
    val.assign(2 * n - 1, identity);
    lazy.assign(2 * n - 1, lazy_def);

    for (size_t i = 0; i < v.size(); i++) {
      val[i + n - 1] = v[i];
    }
    for (int i = n - 2; i >= 0; i--) {
      val[i] = Monoid::operation(val[2 * i + 1], val[2 * i + 2]);
    }
  }
  void eval(int k, int len) {
    if (lazy[k] == lazy_def)
      return;
    if (k < n - 1) {
      lazy[2 * k + 1] = Monoid::lazy_accumulate(lazy[2 * k + 1], lazy[k]);
      lazy[2 * k + 2] = Monoid::lazy_accumulate(lazy[2 * k + 2], lazy[k]);
    }
    val[k] = Monoid::lazy_update(val[k], lazy[k], len);
    lazy[k] = lazy_def;
  }
  T update(int a, int b, E &e, int k, int l, int r) {
    eval(k, r - l);
    if (r <= a || b <= l)
      return val[k];
    else if (a <= l && r <= b) {
      lazy[k] = Monoid::lazy_accumulate(lazy[k], e);
      eval(k, r - l);
      return val[k];
    } else {
      T lv = update(a, b, e, 2 * k + 1, l, (l + r) / 2);
      T rv = update(a, b, e, 2 * k + 2, (l + r) / 2, r);
      return val[k] = Monoid::operation(lv, rv);
    }
  }
  T update(int a, int b, E e) { return update(a, b, e, 0, 0, n); }
  T query(int a, int b, int k, int l, int r) {
    eval(k, r - l);
    if (r <= a || b <= l)
      return identity;
    if (a <= l && r <= b)
      return val[k];
    T lv = query(a, b, 2 * k + 1, l, (l + r) / 2);
    T rv = query(a, b, 2 * k + 2, (l + r) / 2, r);
    return Monoid::operation(lv, rv);
  }
  T query(int a, int b) { return query(a, b, 0, 0, n); }
  T get(int i) { return query(i, i + 1); }
};

template <typename T> T power(T a, T n, T mod) {
  T res = 1;
  T tmp = n;
  T curr = a;
  while (tmp) {
    if (tmp % 2 == 1) {
      res = (T)(res * curr % mod);
    }
    curr = (T)(curr * curr % mod);
    tmp >>= 1;
  }

  return res;
}

class RUQ {
public:
  using value_type = pair<ll, ll>;
  using lazy_type = ll;
  using T = pair<ll, ll>;
  using E = ll;
  const static T identity;
  const static E lazy_def;
  RUQ() {}
  static T operation(T &l, T &r) {
    return mk((l.first * power<ll>(10, r.second, mod) % mod + r.first) % mod,
              l.second + r.second);
  }
  static E lazy_accumulate(E &l, E &r) { return r; }
  static T lazy_update(T &t, E &e, int len) {
    ll s = (power<ll>(10, len, mod) - 1) * power<ll>(9, mod - 2, mod) % mod;
    s = s * e % mod;
    if (s < 0)
      s += mod;
    return mk(s, len);
  }
};

const pair<ll, ll> RUQ::identity = mk(0, 0);
const ll RUQ::lazy_def = numeric_limits<ll>::min();

int main(int argc, char const *argv[]) {
  int n, q;
  cin >> n >> q;
  vector<pair<ll, ll>> v(n, mk(1, 1));
  LazySegmentTree<RUQ> seg(n, v);
  rep(i, q) {
    /*
    rep(j, seg.val.size()){
      if(j == 1 || j == 3 || j == 7)cerr << endl;
      cerr << seg.val[j] << " ";
    }
    cerr << endl;
    rep(j, seg.val.size()){
      if(j == 1 || j == 3 || j == 7)cerr << endl;
      cerr << seg.lazy[j] << " ";
    }
    cerr << endl;
    */
    int l, r, d;
    cin >> l >> r >> d;
    l--;
    r--;
    seg.update(l, r + 1, d);
    cout << seg.query(0, n).first << "\\n";
  }
  cout << flush;
  return 0;
}