test/rolling_hash.test.cpp

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

Depends on

• string/rolling_hash.hpp

Code

#define PROBLEM   "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_14_B"

#include <bits/stdc++.h>
#include "../string/rolling_hash.hpp"
using namespace std;

using ll=long long;





int main() {
    string T,P;
    cin>>T>>P;
    rolling_hash ht(T),hp(P);
ll N=T.size(),M=P.size();

    for(ll i=0;i<N;i++) {
        if(i+M-1>=N) break;
        if(ht.hash(i,i+M)==hp.hash(0,M)) cout<<i<<endl;
    }
}

#line 1 "test/rolling_hash.test.cpp"
#define PROBLEM   "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_14_B"

#include <bits/stdc++.h>
#line 4 "string/rolling_hash.hpp"

class rolling_hash {
public:
	using u64 = std::uint_fast64_t;
	using size_type = std::uint_fast32_t;
	using i128 = __int128_t;

	static constexpr u64 MOD = (1uL << 61) - 1;
	static constexpr u64 base = 20200213;

	std::string str;
	std::vector<u64> hash_, pow;

private:
	static constexpr u64 mask30 = (1ul << 30) - 1;
	static constexpr u64 mask31 = (1ul << 31) - 1;

	u64 mul(i128 a, i128 b) const {
		i128 t = a * b;
		t = (t >> 61) + (t & MOD);
		
		if(t >= MOD) return t - MOD;
		return t;
	}
	size_type xorshift(size_type x) const {
		x ^= x << 13;
		x ^= x >> 17;
		x ^= x << 5;
		return x;
	}

public:
	rolling_hash(const rolling_hash &) = default;
	rolling_hash(rolling_hash&&) = default;

	rolling_hash() : str() {};

	rolling_hash(const std::string & str) : str(str) {
		hash_.resize(str.size() + 1, 0);
		pow.resize(str.size() + 1, 1);
		for(size_type i = 0; i < str.size(); i++) {
			hash_[i + 1] = mul(hash_[i], base) + xorshift(str[i] + 1);
			pow[i + 1] = mul(pow[i], base);
			if(hash_[i + 1] >= MOD) hash_[i + 1] -= MOD;
		}
	}

	u64 hash() const { return hash_.back(); }
	u64 hash(size_type l, size_type r) const {
		u64 ret = MOD + hash_[r] - mul(hash_[l], pow[r - l]);
		return ret < MOD ? ret : ret - MOD;
	}
	
	size_type size() const { return str.size(); }
};
#line 5 "test/rolling_hash.test.cpp"
using namespace std;

using ll=long long;





int main() {
    string T,P;
    cin>>T>>P;
    rolling_hash ht(T),hp(P);
ll N=T.size(),M=P.size();

    for(ll i=0;i<N;i++) {
        if(i+M-1>=N) break;
        if(ht.hash(i,i+M)==hp.hash(0,M)) cout<<i<<endl;
    }
}

Back to top page