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

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#define EACH(value, var) for (auto value : var)
#define SORT(var) sort(var.begin(), var.end())
#define REVERSE(var) reverse(var.begin(), var.end())
#define RSORT(var)                                                             \\
  SORT(var);                                                                   \\
  REVERSE(var)
#define OPTIMIZE_STDIO                                                         \\
  ios::sync_with_stdio(false);                                                 \\
  cin.tie(0);                                                                  \\
  cout.precision(10);                                                          \\
  cout << fixed
#define endl '\\n'

const ll MOD = 2019;
map<int, int> mp;

void solve(istream &cin, ostream &cout) {
  string s;
  cin >> s;
  REVERSE(s);
  mp.clear();
  int n = s.size();
  int mod = 0, p = 1;
  int ans = 0;
  mp[0]++;
  REP(i, n) {
    mod = (mod + (s[i] - '0') * p) % MOD;
    mp[mod]++;
    p = p * 10 % MOD;
  }
  ans = 0;
  REP(i, MOD) {
    // mp[i] combination 2
    if (mp[i] >= 2)
      ans += mp[i] * (mp[i] - 1) / 2;
  }
  cout << ans << endl;
}

#ifndef TEST
int main() {
  OPTIMIZE_STDIO;
  solve(cin, cout);
  return 0;
}
#endif


Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#define EACH(value, var) for (auto value : var)
#define SORT(var) sort(var.begin(), var.end())
#define REVERSE(var) reverse(var.begin(), var.end())
#define RSORT(var)                                                             \\
  SORT(var);                                                                   \\
  REVERSE(var)
#define OPTIMIZE_STDIO                                                         \\
  ios::sync_with_stdio(false);                                                 \\
  cin.tie(0);                                                                  \\
  cout.precision(10);                                                          \\
  cout << fixed
#define endl '\\n'

const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
struct mint {
  ll x;
  mint() : x(0) {}
  mint(ll x) : x((x % MOD + MOD) % MOD) {}
  mint &operator+=(const mint &r) {
    if ((x += r.x) >= MOD) {
      x -= MOD;
    }
    return *this;
  }
  mint &operator-=(const mint &r) {
    if ((x -= r.x) < 0) {
      x += MOD;
    }
    return *this;
  }
  mint &operator*=(const mint &r) {
    if ((x *= r.x) > MOD) {
      x %= MOD;
    }
    return *this;
  }
  mint &operator++() {
    if ((++x) >= MOD) {
      x -= MOD;
    }
    return *this;
  }
  mint operator++(int) {
    mint ret = x;
    if ((++x) >= MOD) {
      x -= MOD;
    }
    return ret;
  }
  mint &operator--() {
    if ((--x) < 0) {
      x += MOD;
    }
    return *this;
  }
  mint operator--(int) {
    mint ret = x;
    if ((--x) < 0) {
      x += MOD;
    }
    return ret;
  }
  mint operator+(const mint &r) {
    mint ret;
    return ret = x + r.x;
  }
  mint operator-(const mint &r) {
    mint ret;
    return ret = x - r.x;
  }
  mint operator*(const mint &r) {
    mint ret;
    return ret = x * r.x;
  }
  mint operator-() { return mint() - *this; }
  bool operator<(const mint &a) { return x < a.x; }
  bool operator>(const mint &a) { return x > a.x; }
  bool operator<=(const mint &a) { return x <= a.x; }
  bool operator>=(const mint &a) { return x >= a.x; }
  bool operator==(const mint &a) { return x == a.x; }
  bool operator!=(const mint &a) { return x != a.x; }
};
ostream &operator<<(ostream &os, const mint &r) {
  os << r.x;
  return os;
}
ostream &operator>>(ostream &os, const mint &r) {
  os >> r.x;
  return os;
}

void solve(istream &cin, ostream &cout) {
  string s;
  cin >> s;
  if (s.length() <= 3) {
    cout << 0 << endl;
    return;
  }
  int ans = 0;
  FOR(i, 4, s.length()) {
    REP(j, s.length()) {
      string c = s.substr(j, i);
      if (j + i >= s.length())
        continue;
      if (c.length() <= 3)
        continue;
      string u = c.substr(0, c.length() / 2);
      string d = c.substr(c.length() / 2);
      if (atoi(u.substr(u.length() - 1, 1).c_str()) % 2 != 0)
        continue;
      ll sum = 0;
      if (d.length() >= 3) {
        REP(i, d.length() - 2) {
          string di = d.substr(d.length() - i - 1, 1);
          sum += 2 * atoi(di.c_str());
        }
      }
      sum += atoi(d.substr(0, 2).c_str());
      if (sum % 19 == 0) {
        ans++;
      }
    }
  }
  cout << ans << endl;
}

#ifndef TEST
int main() {
  OPTIMIZE_STDIO;
  solve(cin, cout);
  return 0;
}
#endif