This documentation is automatically generated by competitive-verifier/competitive-verifier
文字列 $S$ の部分文字列に文字列 $T$ が存在するかを高速に判定する.
RollingHash(s)
:文字列 s
のハッシュテーブルを構築する.get(l, r)
:$S$ の部分文字列 $S[l, r)$ のハッシュ値を返す.get(t)
:文字列 $T$ のハッシュ値を返す.match(t)
:文字列 $T$ と等しい,$S$ の部分文字列 $S[l, r)$ の $l$ を格納した配列を返す.文字列 $S, T$ の長さをそれぞれ $n, m$ とする.
get(l, r)
:$O(1)$get(t)
:$O(m)$match(t)
:$O(n)$#pragma once
#ifndef call_include
#define call_include
#include <bits/stdc++.h>
using namespace std;
#endif
struct RollingHash {
private:
const int N;
const long long MOD1 = 1000000007;
const long long MOD2 = 1992732529;
random_device rd;
mt19937 mt = mt19937(rd());
uniform_int_distribution<long long> dist1, dist2;
const long long base1, base2;
vector<long long> hash1, hash2, pw1, pw2;
public:
RollingHash(string &s) :
N(s.size()),
dist1(257, MOD1 - 2),
dist2(257, MOD2 - 2),
base1(dist1(mt)),
base2(dist2(mt)),
hash1(N + 1, 0),
hash2(N + 1, 0),
pw1(N + 1, 1),
pw2(N + 1, 1) {
for(int i = 0; i < N; i++) {
pw1[i + 1] = pw1[i] * base1 % MOD1;
pw2[i + 1] = pw2[i] * base2 % MOD2;
hash1[i + 1] = hash1[i] * base1 % MOD1 + int(s[i]);
hash2[i + 1] = hash2[i] * base2 % MOD2 + int(s[i]);
if(hash1[i + 1] >= MOD1) hash1[i + 1] -= MOD1;
if(hash2[i + 1] >= MOD2) hash2[i + 1] -= MOD2;
}
}
pair<long long, long long> get(int l, int r) {
assert(l <= r);
assert(0 <= l and r <= N);
long long h1 = hash1[r] - hash1[l] * pw1[r - l] % MOD1;
long long h2 = hash2[r] - hash2[l] * pw2[r - l] % MOD2;
if(h1 < 0) h1 += MOD1;
if(h2 < 0) h2 += MOD2;
return pair(h1, h2);
}
pair<long long, long long> get(string &t) {
const int M = t.size();
long long h1_t = 0, h2_t = 0;
for(int i = 0; i < M; i++) {
h1_t = h1_t * base1 % MOD1 + int(t[i]);
h2_t = h2_t * base2 % MOD2 + int(t[i]);
if(h1_t >= MOD1) h1_t -= MOD1;
if(h2_t >= MOD2) h2_t -= MOD2;
}
return pair(h1_t, h2_t);
}
vector<int> match(string &t) {
const int M = t.size();
if(N < M) return {};
vector<int> ret;
pair<long long, long long> pt = get(t);
for(int i = 0; i + M <= N; i++) {
pair<long long, long long> p = get(i, i + M);
if(p.first == pt.first and p.second == pt.second) ret.emplace_back(i);
}
return ret;
}
};
#line 2 "string/rolling_hash.cpp"
#ifndef call_include
#define call_include
#include <bits/stdc++.h>
using namespace std;
#endif
struct RollingHash {
private:
const int N;
const long long MOD1 = 1000000007;
const long long MOD2 = 1992732529;
random_device rd;
mt19937 mt = mt19937(rd());
uniform_int_distribution<long long> dist1, dist2;
const long long base1, base2;
vector<long long> hash1, hash2, pw1, pw2;
public:
RollingHash(string &s) :
N(s.size()),
dist1(257, MOD1 - 2),
dist2(257, MOD2 - 2),
base1(dist1(mt)),
base2(dist2(mt)),
hash1(N + 1, 0),
hash2(N + 1, 0),
pw1(N + 1, 1),
pw2(N + 1, 1) {
for(int i = 0; i < N; i++) {
pw1[i + 1] = pw1[i] * base1 % MOD1;
pw2[i + 1] = pw2[i] * base2 % MOD2;
hash1[i + 1] = hash1[i] * base1 % MOD1 + int(s[i]);
hash2[i + 1] = hash2[i] * base2 % MOD2 + int(s[i]);
if(hash1[i + 1] >= MOD1) hash1[i + 1] -= MOD1;
if(hash2[i + 1] >= MOD2) hash2[i + 1] -= MOD2;
}
}
pair<long long, long long> get(int l, int r) {
assert(l <= r);
assert(0 <= l and r <= N);
long long h1 = hash1[r] - hash1[l] * pw1[r - l] % MOD1;
long long h2 = hash2[r] - hash2[l] * pw2[r - l] % MOD2;
if(h1 < 0) h1 += MOD1;
if(h2 < 0) h2 += MOD2;
return pair(h1, h2);
}
pair<long long, long long> get(string &t) {
const int M = t.size();
long long h1_t = 0, h2_t = 0;
for(int i = 0; i < M; i++) {
h1_t = h1_t * base1 % MOD1 + int(t[i]);
h2_t = h2_t * base2 % MOD2 + int(t[i]);
if(h1_t >= MOD1) h1_t -= MOD1;
if(h2_t >= MOD2) h2_t -= MOD2;
}
return pair(h1_t, h2_t);
}
vector<int> match(string &t) {
const int M = t.size();
if(N < M) return {};
vector<int> ret;
pair<long long, long long> pt = get(t);
for(int i = 0; i + M <= N; i++) {
pair<long long, long long> p = get(i, i + M);
if(p.first == pt.first and p.second == pt.second) ret.emplace_back(i);
}
return ret;
}
};