Problem p00373 (C++) — buggy submission, verdict: Time 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 unsigned long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;

int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  int H, W, h, w;
  cin >> W >> H >> w >> h;
  vector<string> A(H), B(h);
  set<char> cs;

  rep(i, H) {
    cin >> A[i];
    for (char c : A[i])
      cs.insert(c);
  }
  rep(i, h) {
    cin >> B[i];
    for (char c : B[i])
      cs.insert(c);
  }
  cs.erase('?');

  vector<vector<bool>> ok(H, vector<bool>(W, 1));

  for (char c : cs) {
    int any = 0;
    vector<vector<ll>> t(H, vector<ll>(W));
    rep(i, H) for (int j = W - 1; j >= 0; j--) {
      if (j < W - 1)
        t[i][j] = t[i][j + 1] << 1;
      if (A[i][j] != c && A[i][j] != '?') {
        t[i][j] |= 1;
        any |= 1;
      }
    }

    vector<vector<ll>> u(h, vector<ll>(2));
    rep(i, h) rep(j, w) if (B[i][j] == c) {
      u[i][j / 64] |= 1ull << j % 64;
      any |= 2;
    }
    if (any != 3)
      continue;

    rep(i, H - h + 1) rep(j, W - w + 1) if (ok[i][j]) {
      rep(k, h) {
        if (u[k][0] & t[i + k][j])
          goto BAD;
        if (w > 64 && (u[k][1] & t[i + k][j + 64]))
          goto BAD;
      }
      continue;
    BAD:
      ok[i][j] = 0;
    }
  }

  int ans = 0;
  rep(i, H - h + 1) rep(j, W - w + 1) if (ok[i][j]) ans++;
  cout << ans << endl;

  return 0;
}


Error: TLE

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 unsigned long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;

int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  int H, W, h, w;
  cin >> W >> H >> w >> h;
  vector<string> A(H), B(h);
  set<char> cs;

  rep(i, H) {
    cin >> A[i];
    for (char c : A[i])
      cs.insert(c);
  }
  rep(i, h) {
    cin >> B[i];
    for (char c : B[i])
      cs.insert(c);
  }
  cs.erase('?');

  vector<vector<bool>> ok(H, vector<bool>(W, 1));

  for (char c : cs) {
    vector<vector<ll>> t(H, vector<ll>(W));
    rep(i, H) for (int j = W - 1; j >= 0; j--) {
      if (j < W - 1)
        t[i][j] = t[i][j + 1] << 1;
      if (A[i][j] != c && A[i][j] != '?')
        t[i][j] |= 1;
    }
    vector<vector<ll>> u(h, vector<ll>(2));
    rep(i, h) rep(j, w) if (B[i][j] == c) u[i][j / 64] |= 1ull << j % 64;

    rep(i, H - h + 1) rep(j, W - w + 1) if (ok[i][j]) {
      rep(k, h) {
        if (__builtin_popcountll(u[k][0] & t[i + k][j]))
          goto BAD;
        if (w > 64 && __builtin_popcountll(u[k][1] & t[i + k][j + 64]))
          goto BAD;
      }
      continue;
    BAD:
      ok[i][j] = 0;
    }
  }

  int ans = 0;
  rep(i, H - h + 1) rep(j, W - w + 1) if (ok[i][j]) ans++;
  cout << ans << endl;

  return 0;
}