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

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

Depends on

• 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 roll;
  auto rh1 = roll.build(T);
  auto rh2 = roll.build(P);
  for(int i = 0; i + P.size() <= T.size(); i++) {
    if(roll.query(rh1, i, i + P.size()) == roll.query(rh2, 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>

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(forward<F>(f)) {}

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

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

#line 1 "string/rolling-hash.hpp"
/**
 * @brief Rolling-Hash(ローリングハッシュ)
 * @see https://qiita.com/keymoon/items/11fac5627672a6d6a9f6
 *
 */
struct RollingHash {
  static const uint64_t mod = (1ull << 61ull) - 1;
  using uint128_t = __uint128_t;
  vector<uint64_t> power;
  const uint64_t base;

  static inline uint64_t add(uint64_t a, uint64_t b) {
    if ((a += b) >= mod) a -= mod;
    return a;
  }

  static inline uint64_t mul(uint64_t a, uint64_t b) {
    uint128_t c = (uint128_t)a * b;
    return add(c >> 61, c & mod);
  }

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

  inline void expand(size_t sz) {
    if (power.size() < sz + 1) {
      int pre_sz = (int)power.size();
      power.resize(sz + 1);
      for (int i = pre_sz - 1; i < sz; i++) {
        power[i + 1] = mul(power[i], base);
      }
    }
  }

  explicit RollingHash(uint64_t base = generate_base())
      : base(base), power{1} {}

  vector<uint64_t> build(const string &s) const {
    int sz = s.size();
    vector<uint64_t> hashed(sz + 1);
    for (int i = 0; i < sz; i++) {
      hashed[i + 1] = add(mul(hashed[i], base), s[i]);
    }
    return hashed;
  }

  template <typename T>
  vector<uint64_t> build(const vector<T> &s) const {
    int sz = s.size();
    vector<uint64_t> hashed(sz + 1);
    for (int i = 0; i < sz; i++) {
      hashed[i + 1] = add(mul(hashed[i], base), s[i]);
    }
    return hashed;
  }

  uint64_t query(const vector<uint64_t> &s, int l, int r) {
    expand(r - l);
    return add(s[r], mod - mul(s[l], power[r - l]));
  }

  uint64_t combine(uint64_t h1, uint64_t h2, size_t h2len) {
    expand(h2len);
    return add(mul(h1, power[h2len]), h2);
  }

  int lcp(const vector<uint64_t> &a, int l1, int r1, const vector<uint64_t> &b,
          int l2, int r2) {
    int len = min(r1 - l1, r2 - l2);
    int low = 0, high = len + 1;
    while (high - low > 1) {
      int mid = (low + high) / 2;
      if (query(a, l1, l1 + mid) == query(b, l2, l2 + mid))
        low = mid;
      else
        high = mid;
    }
    return low;
  }
};
#line 6 "test/verify/aoj-alds-1-14-b.test.cpp"

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

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample_00.in	AC	6 ms	4 MB
g++	01_small_00.in	AC	6 ms	4 MB
g++	01_small_01.in	AC	6 ms	4 MB
g++	01_small_02.in	AC	6 ms	4 MB
g++	01_small_03.in	AC	6 ms	4 MB
g++	02_rand_00.in	AC	6 ms	4 MB
g++	02_rand_01.in	AC	5 ms	4 MB
g++	02_rand_02.in	AC	5 ms	4 MB
g++	02_rand_03.in	AC	6 ms	4 MB
g++	02_rand_04.in	AC	6 ms	4 MB
g++	02_rand_05.in	AC	6 ms	4 MB
g++	02_rand_06.in	AC	6 ms	4 MB
g++	02_rand_07.in	AC	7 ms	4 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	7 ms	4 MB
g++	03_large_03.in	AC	7 ms	4 MB
g++	03_large_04.in	AC	17 ms	12 MB
g++	03_large_05.in	AC	18 ms	12 MB
g++	03_large_06.in	AC	17 ms	12 MB
g++	03_large_07.in	AC	18 ms	12 MB
g++	03_large_08.in	AC	18 ms	12 MB
g++	03_large_09.in	AC	18 ms	12 MB
g++	04_embedded_00.in	AC	18 ms	12 MB
g++	04_embedded_01.in	AC	19 ms	12 MB
g++	04_embedded_02.in	AC	18 ms	12 MB
g++	04_embedded_03.in	AC	19 ms	12 MB
g++	04_embedded_04.in	AC	19 ms	12 MB
g++	04_embedded_05.in	AC	18 ms	12 MB
g++	05_corner_00.in	AC	6 ms	4 MB
g++	05_corner_01.in	AC	6 ms	4 MB
g++	05_corner_02.in	AC	6 ms	4 MB
g++	05_corner_03.in	AC	792 ms	12 MB
g++	05_corner_04.in	AC	776 ms	12 MB
g++	05_corner_05.in	AC	19 ms	12 MB
g++	05_corner_06.in	AC	18 ms	12 MB
clang++	00_sample_00.in	AC	6 ms	4 MB
clang++	01_small_00.in	AC	6 ms	4 MB
clang++	01_small_01.in	AC	6 ms	4 MB
clang++	01_small_02.in	AC	6 ms	4 MB
clang++	01_small_03.in	AC	6 ms	4 MB
clang++	02_rand_00.in	AC	6 ms	4 MB
clang++	02_rand_01.in	AC	6 ms	4 MB
clang++	02_rand_02.in	AC	6 ms	4 MB
clang++	02_rand_03.in	AC	6 ms	4 MB
clang++	02_rand_04.in	AC	6 ms	4 MB
clang++	02_rand_05.in	AC	6 ms	4 MB
clang++	02_rand_06.in	AC	6 ms	4 MB
clang++	02_rand_07.in	AC	8 ms	4 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	8 ms	4 MB
clang++	03_large_03.in	AC	8 ms	4 MB
clang++	03_large_04.in	AC	22 ms	12 MB
clang++	03_large_05.in	AC	23 ms	12 MB
clang++	03_large_06.in	AC	23 ms	12 MB
clang++	03_large_07.in	AC	23 ms	12 MB
clang++	03_large_08.in	AC	22 ms	12 MB
clang++	03_large_09.in	AC	23 ms	12 MB
clang++	04_embedded_00.in	AC	24 ms	12 MB
clang++	04_embedded_01.in	AC	23 ms	12 MB
clang++	04_embedded_02.in	AC	23 ms	12 MB
clang++	04_embedded_03.in	AC	23 ms	12 MB
clang++	04_embedded_04.in	AC	24 ms	12 MB
clang++	04_embedded_05.in	AC	23 ms	12 MB
clang++	05_corner_00.in	AC	6 ms	4 MB
clang++	05_corner_01.in	AC	6 ms	4 MB
clang++	05_corner_02.in	AC	6 ms	4 MB
clang++	05_corner_03.in	AC	784 ms	12 MB
clang++	05_corner_04.in	AC	804 ms	12 MB
clang++	05_corner_05.in	AC	24 ms	12 MB
clang++	05_corner_06.in	AC	24 ms	12 MB

Back to top page