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

#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
// #include "libs.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
// #include <opencv2/core.hpp>
// #include <opencv2/highgui.hpp>
// #include <opencv2/imgproc.hpp>

using namespace std;

// 呪文
#define DUMPOUT cerr
#define dump(...)                                                              \\
  DUMPOUT << "  ";                                                             \\
  DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]"   \\
          << endl;                                                             \\
  DUMPOUT << "    ";                                                           \\
  dump_func(__VA_ARGS__)

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const pair<_KTy, _Ty> &m) {
  o << "{" << m.first << ", " << m.second << "}";
  return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const map<_KTy, _Ty> &m) {
  if (m.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const unordered_map<_KTy, _Ty> &m) {
  if (m.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const vector<_Ty> &v) {
  if (v.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << v.front();
  for (auto itr = ++v.begin(); itr != v.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const set<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty>
ostream &operator<<(ostream &o, const unordered_set<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const stack<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  stack<_Ty> t(s);
  o << "{" << t.top();
  t.pop();
  while (!t.empty()) {
    o << ", " << t.top();
    t.pop();
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const list<_Ty> &l) {
  if (l.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << l.front();
  for (auto itr = ++l.begin(); itr != l.end(); ++itr) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _KTy, typename _Ty>
istream &operator>>(istream &is, pair<_KTy, _Ty> &m) {
  is >> m.first >> m.second;
  return is;
}
template <typename _Ty> istream &operator>>(istream &is, vector<_Ty> &v) {
  for (size_t i = 0; i < v.size(); i++)
    is >> v[i];
  return is;
}
namespace aux { // print tuple
template <typename Ty, unsigned N, unsigned L> struct tp {
  static void print(ostream &os, const Ty &v) {
    os << get<N>(v) << ", ";
    tp<Ty, N + 1, L>::print(os, v);
  }
};
template <typename Ty, unsigned N> struct tp<Ty, N, N> {
  static void print(ostream &os, const Ty &v) { os << get<N>(v); }
};
} // namespace aux
template <typename... Tys>
ostream &operator<<(ostream &os, const tuple<Tys...> &t) {
  os << "{";
  aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t);
  os << "}";
  return os;
}

template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) == 0) {
    DUMPOUT << " ";
  } else {
    DUMPOUT << ", ";
  }
  dump_func(std::move(tail)...);
}

#define PI 3.14159265358979323846
#define EPS 1e-10
#define FOR(is, a, n) for (int is = (a); is < (n); ++is)
#define REP(is, n) FOR(is, 0, n)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false

const int MOD = 2000003;
ll table[MOD];
map<char, int> mp({{'A', 1}, {'C', 2}, {'G', 3}, {'T', 4}});

ll getKey(const string &S) {
  ll res = 0;
  for (int i = (int)S.size() - 1; i >= 0; i--) {
    res *= 5;
    res += mp[S[i]];
  }
  return res;
}

ll h1(ll key) { return key % MOD; }
ll h2(ll key) { return 1 + (key % (MOD - 1)); }

bool search(const string &str) {
  ll key = getKey(str);
  for (int i = 0;; i++) {
    ll h = (h1(key) + i * h2(key)) % MOD;
    if (table[h] == key)
      return true;
    else if (table[h] == 0)
      return false;
  }
  return false;
}

void insert(const string &str) {
  ll key = getKey(str);
  for (int i = 0;; i++) {
    ll h = (h1(key) + i * h2(key)) % MOD;
    if (table[h] == 0) {
      table[h] = key;
      return;
    }
  }
}

int main() {

  cin.tie(0);
  ios::sync_with_stdio(false);

  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    string op, str;
    cin >> op >> str;
    if (op == "insert")
      insert(str);
    else
      cout << (search(str) ? "yes" : "no") << endl;
  }

  return 0;
}


Error: TLE

Fixed submission:

#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
// #include "libs.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
// #include <opencv2/core.hpp>
// #include <opencv2/highgui.hpp>
// #include <opencv2/imgproc.hpp>

using namespace std;

// 呪文
#define DUMPOUT cerr
#define dump(...)                                                              \\
  DUMPOUT << "  ";                                                             \\
  DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]"   \\
          << endl;                                                             \\
  DUMPOUT << "    ";                                                           \\
  dump_func(__VA_ARGS__)

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const pair<_KTy, _Ty> &m) {
  o << "{" << m.first << ", " << m.second << "}";
  return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const map<_KTy, _Ty> &m) {
  if (m.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const unordered_map<_KTy, _Ty> &m) {
  if (m.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const vector<_Ty> &v) {
  if (v.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << v.front();
  for (auto itr = ++v.begin(); itr != v.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const set<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty>
ostream &operator<<(ostream &o, const unordered_set<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const stack<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  stack<_Ty> t(s);
  o << "{" << t.top();
  t.pop();
  while (!t.empty()) {
    o << ", " << t.top();
    t.pop();
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const list<_Ty> &l) {
  if (l.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << l.front();
  for (auto itr = ++l.begin(); itr != l.end(); ++itr) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _KTy, typename _Ty>
istream &operator>>(istream &is, pair<_KTy, _Ty> &m) {
  is >> m.first >> m.second;
  return is;
}
template <typename _Ty> istream &operator>>(istream &is, vector<_Ty> &v) {
  for (size_t i = 0; i < v.size(); i++)
    is >> v[i];
  return is;
}
namespace aux { // print tuple
template <typename Ty, unsigned N, unsigned L> struct tp {
  static void print(ostream &os, const Ty &v) {
    os << get<N>(v) << ", ";
    tp<Ty, N + 1, L>::print(os, v);
  }
};
template <typename Ty, unsigned N> struct tp<Ty, N, N> {
  static void print(ostream &os, const Ty &v) { os << get<N>(v); }
};
} // namespace aux
template <typename... Tys>
ostream &operator<<(ostream &os, const tuple<Tys...> &t) {
  os << "{";
  aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t);
  os << "}";
  return os;
}

template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) == 0) {
    DUMPOUT << " ";
  } else {
    DUMPOUT << ", ";
  }
  dump_func(std::move(tail)...);
}

#define PI 3.14159265358979323846
#define EPS 1e-10
#define FOR(is, a, n) for (int is = (a); is < (n); ++is)
#define REP(is, n) FOR(is, 0, n)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false

struct SXor128 {
  unsigned x, y, z, w;
  SXor128() {
    x = 123456789;
    y = 362436069;
    z = 521288629;
    w = 88675123;
  }
  SXor128(int _w) {
    x = 123456789;
    y = 362436069;
    z = 521288629;
    w = _w;
  }
  void setSeed() {
    x = 123456789;
    y = 362436069;
    z = 521288629;
    w = 88675123;
  }
  void setSeed(int _w) {
    x = 123456789;
    y = 362436069;
    z = 521288629;
    w = _w;
  }
  unsigned nextUInt() {
    unsigned t = (x ^ (x << 11));
    x = y;
    y = z;
    z = w;
    return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
  }
  unsigned nextUInt(unsigned mod) {
    unsigned t = (x ^ (x << 11));
    x = y;
    y = z;
    z = w;
    w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
    return w % mod;
  }
  unsigned nextUInt(unsigned l, unsigned r) {
    unsigned t = (x ^ (x << 11));
    x = y;
    y = z;
    z = w;
    w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
    return w % (r - l + 1) + l;
  }
  double nextDouble() { return double(nextUInt()) / UINT_MAX; }
} rnd;

const uint MOD = 9999991;
string table[MOD];
vector<uint> r;

int h1(const string &key) {
  int res = 0;
  for (int i = 0; i < key.size(); i++)
    res = (res + int(key[i]) * r[i]) % MOD;
  return res;
}

int h2(const string &key) {
  int x = 0;
  for (auto c : key)
    x += c;
  return 1 + x % (MOD - 1);
}

int h(const string &key, int i) { return (h1(key) + i * h2(key)) % MOD; }

void insert(const string &key) {
  int i = 0;
  while (true) {
    int j = h(key, i);
    if (table[j].empty()) {
      table[j] = key;
      return;
    } else
      i++;
  }
}

bool search(const string &key) {
  int i = 0;
  while (true) {
    int j = h(key, i);
    if (table[j] == key)
      return true;
    else if (table[j].empty() || i >= MOD)
      return false;
    else
      i++;
  }
}

int main() {

  cin.tie(0);
  ios::sync_with_stdio(false);

  r.resize(12, rnd.nextUInt() % MOD);
  vector<bool> table(MOD, false);

  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    string op, str;
    cin >> op >> str;
    if (op == "insert")
      insert(str);
    else
      cout << (search(str) ? "yes" : "no") << endl;
  }

  return 0;
}