test/verify/aoj-alds-1-14-b.test.cpp

• View this file on GitHub
• Last update: 2024-09-23 18:42:59+09:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_14_B

Depends on

• math/combinatorics/modint-2-61m1.hpp
• Rolling Hash (ローリングハッシュ) (string/rolling-hash.hpp)
• template/template.hpp

Code

// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_14_B

#include "../../template/template.hpp"

#include "../../string/rolling-hash.hpp"

int main() {
  string T, P;
  cin >> T;
  cin >> P;
  RollingHash rh1(T), rh2(P);
  for(int i = 0; i + P.size() <= T.size(); i++) {
    if(rh1.get(i, i + P.size()) == rh2.get(0, P.size())) {
      cout << i << endl;
    }
  }
}

#line 1 "test/verify/aoj-alds-1-14-b.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_14_B

#line 1 "template/template.hpp"
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template <typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(std::forward<F>(f)) {}

  template <typename... Args>
  decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};

template <typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{std::forward<F>(f)};
}
#line 4 "test/verify/aoj-alds-1-14-b.test.cpp"

#line 1 "math/combinatorics/modint-2-61m1.hpp"
struct ModInt_2_61m1 {
 private:
  using mint = ModInt_2_61m1;
  using u64 = uint64_t;
  using u128 = __uint128_t;

  u64 x;

 public:
  ModInt_2_61m1() : x{} {}

  explicit ModInt_2_61m1(u64 a) : x{a} {}

  mint &operator+=(const mint &p) {
    if ((x += p.x) >= mod()) x -= mod();
    return *this;
  }

  mint &operator-=(const mint &p) {
    if ((x += mod() - p.x) >= mod()) x -= mod();
    return *this;
  }

  mint &operator*=(const mint &p) {
    u128 c = (u128)x * p.x;
    x = u64(c >> 61) + u64(c & mod());
    if (x >= mod()) x -= mod();
    return *this;
  }

  mint &operator/=(const mint &p) {
    *this *= p.inv();
    return *this;
  }

  mint operator-() const { return mint() - *this; }

  mint operator+(const mint &p) const { return mint(*this) += p; }

  mint operator-(const mint &p) const { return mint(*this) -= p; }

  mint operator*(const mint &p) const { return mint(*this) *= p; }

  mint operator/(const mint &p) const { return mint(*this) /= p; }

  bool operator==(const mint &p) const { return x == p.x; }

  bool operator!=(const mint &p) const { return x != p.x; }

  u64 val() const { return x; }

  mint pow(u64 n) const {
    mint ret(1), mul(*this);
    while (n > 0) {
      if (n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  mint inv() const { return pow(mod() - 2); }

  friend ostream &operator<<(ostream &os, const mint &p) {
    return os << p.val();
  }

  friend istream &operator>>(istream &is, mint &a) {
    u64 t;
    is >> t;
    a = mint(t);
    return is;
  }

  static constexpr u64 mod() { return (1ull << 61) - 1; }
};
#line 2 "string/rolling-hash.hpp"

template <typename T = char>
struct RollingHash {
 private:
  using mint = ModInt_2_61m1;

  static mint generate_base() {
    mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
    uniform_int_distribution<uint64_t> rand(1, mint::mod() - 1);
    return mint(rand(mt));
  }

  static mint base, base_inv;
  static vector<mint> bases, base_invs;

  vector<T> pre, suf;
  vector<mint> PRE{mint(0)}, SUF{mint(0)};

  static void expand_bases(size_t n) {
    if (bases.size() < n + 1) {
      int pre_sz = (int)bases.size();
      bases.resize(n + 1);
      for (int i = pre_sz - 1; i < n; i++) {
        bases[i + 1] = bases[i] * base;
      }
    }
  }

  static void expand_base_invs(size_t n) {
    if (base_invs.size() < n + 1) {
      int pre_sz = (int)base_invs.size();
      base_invs.resize(n + 1);
      for (int i = pre_sz - 1; i < n; i++) {
        base_invs[i + 1] = base_invs[i] * base_inv;
      }
    }
  }

 public:
  RollingHash() = default;

  explicit RollingHash(const string& s) {
    for (auto& c : s) push_back(c);
  }

  explicit RollingHash(const vector<T>& s) {
    for (auto& c : s) push_back(c);
  }

  int size() const { return (int)pre.size() + (int)suf.size(); }

  void push_front(T c) {
    expand_base_invs(pre.size() + 1);
    PRE.push_back(PRE.back() + base_invs[pre.size() + 1] * mint(c));
    pre.push_back(c);
  }

  void push_back(T c) {
    expand_bases(suf.size());
    SUF.push_back(SUF.back() + bases[suf.size()] * mint(c));
    suf.push_back(c);
  }

  T operator[](int k) const {
    assert(0 <= k and k < size());
    k -= (int)pre.size();
    return k < 0 ? pre[~k] : suf[k];
  }

  mint get(int r) const {
    assert(0 <= r and r <= size());
    r -= (int)pre.size();
    expand_bases(pre.size());
    if (r < 0) {
      return bases[pre.size()] * (PRE.back() - PRE[-r]);
    } else {
      return bases[pre.size()] * (PRE.back() + SUF[r]);
    }
  }

  mint get(int l, int r) const {
    assert(0 <= l and l <= r and r <= size());
    expand_base_invs(l);
    return base_invs[l] * (get(r) - get(l));
  }

  int lcp(const RollingHash& b) const {
    int len = min(size(), b.size());
    int low = 0, high = len + 1;
    while (high - low > 1) {
      int mid = (low + high) / 2;
      if (get(mid) == b.get(mid))
        low = mid;
      else
        high = mid;
    }
    return low;
  }

  int lcp(const RollingHash& b, int l1, int l2) const {
    assert(l1 <= size());
    assert(l2 <= b.size());
    int len = min(size() - l1, b.size() - l2);
    int low = 0, high = len + 1;
    while (high - low > 1) {
      int mid = (low + high) / 2;
      if (get(l1, l1 + mid) == b.get(l2, l2 + mid))
        low = mid;
      else
        high = mid;
    }
    return low;
  }

  static mint combine(mint h1, int h1_len, mint h2) {
    expand_bases(h1_len);
    return h1 + h2 * bases[h1_len];
  }

  void clear() {
    pre.clear();
    pre.shrink_to_fit();
    suf.clear();
    suf.shrink_to_fit();
    PRE = {mint(1)};
    PRE.shrink_to_fit();
    SUF = {mint(1)};
    SUF.shrink_to_fit();
  }

  void merge(RollingHash& b) {
    if (size() < b.size()) {
      pre.swap(b.pre);
      suf.swap(b.suf);
      PRE.swap(b.PRE);
      SUF.swap(b.SUF);
      reverse(b.suf.begin(), b.suf.end());
      for (auto& c : b.suf) push_front(c);
      for (auto& c : b.pre) push_front(c);
    } else {
      reverse(b.pre.begin(), b.pre.end());
      for (auto& c : b.pre) push_back(c);
      for (auto& c : b.suf) push_back(c);
    }
    b.clear();
  }
};

template <typename T>
ModInt_2_61m1 RollingHash<T>::base = RollingHash::generate_base();
template <typename T>
ModInt_2_61m1 RollingHash<T>::base_inv = base.inv();
template <typename T>
vector<ModInt_2_61m1> RollingHash<T>::bases = {ModInt_2_61m1(1)};
template <typename T>
vector<ModInt_2_61m1> RollingHash<T>::base_invs = {ModInt_2_61m1(1)};
#line 6 "test/verify/aoj-alds-1-14-b.test.cpp"

int main() {
  string T, P;
  cin >> T;
  cin >> P;
  RollingHash rh1(T), rh2(P);
  for(int i = 0; i + P.size() <= T.size(); i++) {
    if(rh1.get(i, i + P.size()) == rh2.get(0, P.size())) {
      cout << i << endl;
    }
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample_00.in	AC	6 ms	3 MB
g++	01_small_00.in	AC	5 ms	3 MB
g++	01_small_01.in	AC	5 ms	3 MB
g++	01_small_02.in	AC	5 ms	3 MB
g++	01_small_03.in	AC	4 ms	3 MB
g++	02_rand_00.in	AC	4 ms	3 MB
g++	02_rand_01.in	AC	5 ms	3 MB
g++	02_rand_02.in	AC	5 ms	3 MB
g++	02_rand_03.in	AC	5 ms	4 MB
g++	02_rand_04.in	AC	5 ms	3 MB
g++	02_rand_05.in	AC	5 ms	4 MB
g++	02_rand_06.in	AC	5 ms	4 MB
g++	02_rand_07.in	AC	12 ms	7 MB
g++	03_large_00.in	AC	6 ms	4 MB
g++	03_large_01.in	AC	6 ms	4 MB
g++	03_large_02.in	AC	12 ms	7 MB
g++	03_large_03.in	AC	12 ms	7 MB
g++	03_large_04.in	AC	59 ms	38 MB
g++	03_large_05.in	AC	60 ms	38 MB
g++	03_large_06.in	AC	60 ms	39 MB
g++	03_large_07.in	AC	60 ms	39 MB
g++	03_large_08.in	AC	60 ms	39 MB
g++	03_large_09.in	AC	60 ms	39 MB
g++	04_embedded_00.in	AC	61 ms	38 MB
g++	04_embedded_01.in	AC	60 ms	39 MB
g++	04_embedded_02.in	AC	61 ms	39 MB
g++	04_embedded_03.in	AC	61 ms	39 MB
g++	04_embedded_04.in	AC	61 ms	39 MB
g++	04_embedded_05.in	AC	61 ms	39 MB
g++	05_corner_00.in	AC	5 ms	3 MB
g++	05_corner_01.in	AC	5 ms	3 MB
g++	05_corner_02.in	AC	5 ms	3 MB
g++	05_corner_03.in	AC	768 ms	38 MB
g++	05_corner_04.in	AC	767 ms	39 MB
g++	05_corner_05.in	AC	60 ms	39 MB
g++	05_corner_06.in	AC	62 ms	39 MB
clang++	00_sample_00.in	AC	5 ms	3 MB
clang++	01_small_00.in	AC	5 ms	3 MB
clang++	01_small_01.in	AC	5 ms	3 MB
clang++	01_small_02.in	AC	5 ms	3 MB
clang++	01_small_03.in	AC	5 ms	3 MB
clang++	02_rand_00.in	AC	5 ms	3 MB
clang++	02_rand_01.in	AC	5 ms	3 MB
clang++	02_rand_02.in	AC	5 ms	3 MB
clang++	02_rand_03.in	AC	5 ms	4 MB
clang++	02_rand_04.in	AC	5 ms	4 MB
clang++	02_rand_05.in	AC	5 ms	4 MB
clang++	02_rand_06.in	AC	5 ms	4 MB
clang++	02_rand_07.in	AC	12 ms	7 MB
clang++	03_large_00.in	AC	6 ms	4 MB
clang++	03_large_01.in	AC	6 ms	4 MB
clang++	03_large_02.in	AC	12 ms	7 MB
clang++	03_large_03.in	AC	13 ms	7 MB
clang++	03_large_04.in	AC	62 ms	38 MB
clang++	03_large_05.in	AC	64 ms	38 MB
clang++	03_large_06.in	AC	63 ms	39 MB
clang++	03_large_07.in	AC	63 ms	39 MB
clang++	03_large_08.in	AC	63 ms	39 MB
clang++	03_large_09.in	AC	62 ms	39 MB
clang++	04_embedded_00.in	AC	64 ms	38 MB
clang++	04_embedded_01.in	AC	64 ms	38 MB
clang++	04_embedded_02.in	AC	63 ms	39 MB
clang++	04_embedded_03.in	AC	64 ms	39 MB
clang++	04_embedded_04.in	AC	63 ms	39 MB
clang++	04_embedded_05.in	AC	64 ms	39 MB
clang++	05_corner_00.in	AC	5 ms	3 MB
clang++	05_corner_01.in	AC	5 ms	3 MB
clang++	05_corner_02.in	AC	5 ms	3 MB
clang++	05_corner_03.in	AC	782 ms	38 MB
clang++	05_corner_04.in	AC	776 ms	38 MB
clang++	05_corner_05.in	AC	63 ms	39 MB
clang++	05_corner_06.in	AC	61 ms	39 MB

Back to top page