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

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...)                                                               \\
  do {                                                                         \\
    cerr << __LINE__ << ": ";                                                  \\
    dbgprint(#__VA_ARGS__, __VA_ARGS__);                                       \\
  } while (0);

using namespace std;

namespace std {
template <class S, class T> struct hash<pair<S, T>> {
  size_t operator()(const pair<S, T> &p) const {
    return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
  }
};
template <class T> struct hash<vector<T>> {
  size_t operator()(const vector<T> &v) const {
    size_t h = 0;
    for (auto i : v)
      h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
    return h;
  }
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[ ";
  rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
  return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
  os << "{ ";
  for (const auto &i : v)
    os << i << ", ";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
  os << "{";
  for (const auto &i : v)
    os << " " << i.first << ": " << i.second << ",";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
  cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
  dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;

struct Trie {
  struct Node {
    int sum = 0, cnt = 0;
    vector<pi> next;
    int find(int k) {
      for (pi p : next)
        if (p.first == k)
          return p.second;
      return -1;
    }
  };
  vector<Node> nodes;
  int sz = 1;

  Trie() { nodes.pb(Node()); }

  void put(const string &s) { put(s, 0, 0); }
  void put(const string &s, int idx, int node) {
    int k = s[idx] - 'a', nx = nodes[node].find(k);
    if (nx < 0) {
      nodes.pb(Node());
      nodes[node].next.emplace_back(k, sz++);
    }
    node = nodes[node].find(k);

    nodes[node].sum++;
    if (idx == s.size() - 1)
      nodes[node].cnt++;
    else
      put(s, idx + 1, node);
  }
  int get(const string &s, bool exact) { return get(s, 0, 0, exact); }
  int get(const string &s, int idx, int node, bool exact) {
    int k = s[idx] - 'a', nx = nodes[node].find(k);
    if (nx < 0)
      return 0;
    node = nodes[node].find(k);

    if (idx == s.size() - 1)
      return exact ? nodes[node].cnt : nodes[node].sum;
    else
      return get(s, idx + 1, node, exact);
  }
};

int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  int n, m;
  cin >> n >> m;
  vi ans(m);
  vector<string> in(n), qu(m);
  rep(i, n) cin >> in[i];
  rep(i, m) cin >> qu[i];

  auto solve = [](string s, Trie *t, bool exact) {
    int f = s.find('?');
    if (f == s.npos)
      return t->get(s, exact);
    int ans = 0;
    rep(i, 26) {
      s[f] = 'a' + i;
      ans += t->get(s, exact);
    }
    return ans;
  };

  {
    Trie *t = new Trie;
    rep(i, n) t->put(in[i]);
    rep(i, m) {
      string s = qu[i];
      if (s[0] == '*')
        continue;
      else if (s[s.size() - 1] == '*') {
        s.pop_back();
        ans[i] = solve(s, t, 0);
      } else
        ans[i] = solve(s, t, 1);
    }
    delete t;
  }
  {
    Trie *t = new Trie;
    rep(i, n) {
      reverse(all(in[i]));
      t->put(in[i]);
    }
    rep(i, m) {
      string s = qu[i];
      if (s[0] == '*') {
        reverse(all(s));
        s.pop_back();
        ans[i] = solve(s, t, 0);
      }
      cout << ans[i] << endl;
    }
  }

  /*
  while(m--){
          string s; cin >> s;
          if(s[0] == '*'){
                  reverse(all(s)); s.pop_back();
                  cout << solve(s, rt, 0) << endl;
          }
          else if(s[s.size() - 1] == '*'){
                  s.pop_back();
                  cout << solve(s, t, 0) << endl;
          }
          else cout << solve(s, t, 1) << endl;
  }
  */
  return 0;
}


Error: MLE

Fixed submission:

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...)                                                               \\
  do {                                                                         \\
    cerr << __LINE__ << ": ";                                                  \\
    dbgprint(#__VA_ARGS__, __VA_ARGS__);                                       \\
  } while (0);

using namespace std;

namespace std {
template <class S, class T> struct hash<pair<S, T>> {
  size_t operator()(const pair<S, T> &p) const {
    return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
  }
};
template <class T> struct hash<vector<T>> {
  size_t operator()(const vector<T> &v) const {
    size_t h = 0;
    for (auto i : v)
      h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
    return h;
  }
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[ ";
  rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
  return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
  os << "{ ";
  for (const auto &i : v)
    os << i << ", ";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
  os << "{";
  for (const auto &i : v)
    os << " " << i.first << ": " << i.second << ",";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
  cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
  dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;

struct Trie {
  struct Node {
    int sum = 0, cnt = 0;
    vector<pi> next;
    int find(int k) {
      for (pi p : next)
        if (p.first == k)
          return p.second;
      return -1;
    }
  };
  vector<Node> nodes;
  int sz = 1;

  Trie() { nodes.pb(Node()); }

  void put(const string &s) { put(s, 0, 0); }
  void put(const string &s, int idx, int node) {
    int k = s[idx] - 'a', nx = nodes[node].find(k);
    if (nx < 0) {
      nodes.pb(Node());
      nodes[node].next.emplace_back(k, sz++);
    }
    node = nodes[node].find(k);

    nodes[node].sum++;
    if (idx == s.size() - 1)
      nodes[node].cnt++;
    else
      put(s, idx + 1, node);
  }
  int get(const string &s, bool exact) { return get(s, 0, 0, exact); }
  int get(const string &s, int idx, int node, bool exact) {
    int k = s[idx] - 'a', nx = nodes[node].find(k);
    if (nx < 0)
      return 0;
    node = nodes[node].find(k);

    if (idx == s.size() - 1)
      return exact ? nodes[node].cnt : nodes[node].sum;
    else
      return get(s, idx + 1, node, exact);
  }
};

int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  int n, m;
  cin >> n >> m;
  vi ans(m);
  vector<string> in(n), qu(m);
  rep(i, n) cin >> in[i];
  rep(i, m) cin >> qu[i];

  auto solve = [](string s, Trie *t, bool exact) {
    int f = s.find('?');
    if (f == s.npos)
      return t->get(s, exact);
    int ans = 0;
    rep(i, 26) {
      s[f] = 'a' + i;
      ans += t->get(s, exact);
    }
    return ans;
  };

  {
    Trie *t = new Trie;
    rep(i, n) t->put(in[i]);
    rep(i, m) {
      string s = qu[i];
      if (s[0] == '*')
        continue;
      else if (s[s.size() - 1] == '*') {
        s.pop_back();
        ans[i] = solve(s, t, 0);
      } else
        ans[i] = solve(s, t, 1);
    }
  }
  {
    Trie *t = new Trie;
    rep(i, n) {
      reverse(all(in[i]));
      t->put(in[i]);
    }
    rep(i, m) {
      string s = qu[i];
      if (s[0] == '*') {
        reverse(all(s));
        s.pop_back();
        ans[i] = solve(s, t, 0);
      }
      cout << ans[i] << endl;
    }
  }

  /*
  while(m--){
          string s; cin >> s;
          if(s[0] == '*'){
                  reverse(all(s)); s.pop_back();
                  cout << solve(s, rt, 0) << endl;
          }
          else if(s[s.size() - 1] == '*'){
                  s.pop_back();
                  cout << solve(s, t, 0) << endl;
          }
          else cout << solve(s, t, 1) << endl;
  }
  */
  return 0;
}