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

#include <bits/stdc++.h>
#include <string.h>

typedef long long int ll;
#define all(x) (x).begin(), (x).end()

using namespace std;

int nxt() {
  int x;
  cin >> x;
  return x;
}

ll nxtl() {
  ll x;
  cin >> x;
  return x;
}

void SieveOfEratosthenes(int n, vector<int> &primes) {
  // Create a boolean array "prime[0..n]" and initialize
  // all entries it as true. A value in prime[i] will
  // finally be false if i is Not a prime, else true.
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));

  for (int p = 2; p * p <= n; p++) {
    // If prime[p] is not changed, then it is a prime
    if (prime[p] == true) {
      // Update all multiples of p greater than or
      // equal to the square of it
      // numbers which are multiple of p and are
      // less than p^2 are already been marked.
      for (int i = p * p; i <= n; i += p)
        prime[i] = false;
    }
  }

  // Print all prime numbers
  for (int p = 2; p <= n; p++)
    if (prime[p])
      primes.push_back(p);
}

ll max(ll a, ll b) {
  if (a > b)
    return a;
  return b;
}

ll power(ll x, ll y, ll mod) {
  ll temp;
  if (y == 0)
    return 1;
  temp = power(x, y / 2, mod);
  if (y % 2 == 0)
    return (temp * temp) % mod;
  else
    return (((x * temp) % mod) * temp) % mod;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string s;
  cin >> s;
  int n = s.length();
  vector<int> prev(2019, 0);
  vector<int> cur(2019, 0);
  prev[s[0] - 48] += 1;
  ll x = 0;
  for (int i = 1; i < n; i++) {
    cur[s[i] - 48]++;
    for (int j = 0; j < 2019; j++) {
      cur[(j * 10 + s[i] - 48) % 2019] += prev[j];
    }
    x += cur[0];
    prev = cur;
    for (auto &i : cur)
      i = 0;
  }
  cout << x << endl;

  return 0;
}


Error: MLE

Fixed submission:

#include <bits/stdc++.h>
#include <string.h>

typedef long long int ll;
#define all(x) (x).begin(), (x).end()

using namespace std;

int nxt() {
  int x;
  cin >> x;
  return x;
}

ll nxtl() {
  ll x;
  cin >> x;
  return x;
}

void SieveOfEratosthenes(int n, vector<int> &primes) {
  // Create a boolean array "prime[0..n]" and initialize
  // all entries it as true. A value in prime[i] will
  // finally be false if i is Not a prime, else true.
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));

  for (int p = 2; p * p <= n; p++) {
    // If prime[p] is not changed, then it is a prime
    if (prime[p] == true) {
      // Update all multiples of p greater than or
      // equal to the square of it
      // numbers which are multiple of p and are
      // less than p^2 are already been marked.
      for (int i = p * p; i <= n; i += p)
        prime[i] = false;
    }
  }

  // Print all prime numbers
  for (int p = 2; p <= n; p++)
    if (prime[p])
      primes.push_back(p);
}

ll max(ll a, ll b) {
  if (a > b)
    return a;
  return b;
}

ll power(ll x, ll y, ll mod) {
  ll temp;
  if (y == 0)
    return 1;
  temp = power(x, y / 2, mod);
  if (y % 2 == 0)
    return (temp * temp) % mod;
  else
    return (((x * temp) % mod) * temp) % mod;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string s;
  cin >> s;
  int n = s.length();
  vector<vector<int>> dp;
  vector<int> r1;
  r1.resize(2019, 0);
  dp.resize(n, r1);
  dp[0][s[0] - 48] += 1;
  ll x = 0;
  for (int i = 1; i < n; i++) {
    dp[i][s[i] - 48]++;
    for (int j = 0; j < 2019; j++) {
      dp[i][(j * 10 + s[i] - 48) % 2019] += dp[i - 1][j];
    }
    x += dp[i][0];
  }
  cout << x << endl;

  return 0;
}