mmrz's library

This documentation is automatically generated by online-judge-tools/verification-helper

Project maintained by mm-rz Hosted on GitHub Pages — Theme by mattgraham

:heavy_check_mark: verify/aoj/alds1/14_B.test.cpp

Depends on

Code

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/14/ALDS1_14_B"

#include "./../../../template/template.hpp"
#include "./../../../string/rolling_hash.hpp"

void mmrz::solve(){
	string s, t;
	cin >> s >> t;
	string st = s + t;
	rolling_hash rh(st);

	for(int i = 0;i < (int)s.size() - (int)t.size() + 1;i++){
		if(rh.slice(i, (int)t.size()) == rh.slice((int)s.size(), (int)t.size())){
			cout << i << '\n';
		}
	}
}
#line 1 "verify/aoj/alds1/14_B.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/14/ALDS1_14_B"

#line 1 "template/template.hpp"
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
ll MOD(ll x, ll m){return (x%m+m)%m; }
ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define eb emplace_back
# define exists(c, e)         ((c).find(e) != (c).end())

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

namespace mmrz {
	void solve();
}

int main(){
	mmrz::solve();
}
#line 2 "string/rolling_hash.hpp"

#line 5 "string/rolling_hash.hpp"

struct rolling_hash {
	using ull = unsigned long long;

	const ull MASK30 = (1UL << 30) - 1;
	const ull MASK31 = (1UL << 31) - 1;
	const ull MOD = (1UL << 61) - 1;
	const ull MASK61 = MOD;
	const ull POSITIVIZER = MOD * ((1UL << 3) - 1);

	std::string s;
	int n;
	const ull bs = 23948798;

	std::vector<ull> base_pow;
	std::vector<ull> prefix_hash;

	rolling_hash(std::string _s){
		s = _s;
		n = int(s.size());
		base_pow.resize(n + 1);
		base_pow[0] = 1;
		for(int i = 0;i < n;i++){
			base_pow[i + 1] = calcmod(mul(base_pow[i], bs));
		}	

		prefix_hash.resize(n + 1, 0LL);
		for(int i = 0;i < n;i++){
			prefix_hash[i + 1] = calcmod(mul(prefix_hash[i], bs) + s[i]);	
		}
	}

	ull slice(int begin, int length){
		return calcmod(prefix_hash[begin + length] + POSITIVIZER - mul(prefix_hash[begin], base_pow[length]));
	}

	//a * b % mod (2^{61} - 1)
	ull mul(ull a, ull b){
		ull au = a >> 31;
		ull ad = a & MASK31;
		ull bu = b >> 31;
		ull bd = b & MASK31;
		ull mid = ad * bu + au * bd;
		ull midu = mid >> 30;
		ull midd = mid & MASK30;
		return calcmod(au * bu * 2 + midu + (midd << 31) + ad * bd);
	}

	// mod(2^{61} - 1)
	ull calcmod(ull x){
		ull xu = x >> 61;
		ull xd = x & MASK61;
		ull res = xu + xd;
		if (res >= MOD) res -= MOD;
		return res;
	}
};
#line 5 "verify/aoj/alds1/14_B.test.cpp"

void mmrz::solve(){
	string s, t;
	cin >> s >> t;
	string st = s + t;
	rolling_hash rh(st);

	for(int i = 0;i < (int)s.size() - (int)t.size() + 1;i++){
		if(rh.slice(i, (int)t.size()) == rh.slice((int)s.size(), (int)t.size())){
			cout << i << '\n';
		}
	}
}
Back to top page