seekworser's Library

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

Project maintained by seekworser Hosted on GitHub Pages — Theme by mattgraham

:heavy_check_mark: online_test/AOJ/ALDS_1_14_B.test.cpp

Depends on

Code

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/ALDS1_14_B"
#include "competitive/std/std.hpp"
#include "competitive/string/rolling_hash.hpp"
#include "competitive/std/io.hpp"

int main() {
    string s, t;
    cin >> s >> t;
    int n = sz(s);
    int m = sz(t);
    RollingHash rhs(s, 4);
    RollingHash rht(t);
    auto th = rht.query(0, m);
    rep(i, n-m+1) {
        if (rht.query(0, m) == rhs.query(i, i+m)) print(i);
    }
}
#line 1 "online_test/AOJ/ALDS_1_14_B.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/ALDS1_14_B"
#line 2 "competitive/std/std.hpp"
#include <bits/stdc++.h>
#ifndef LOCAL_TEST
#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif // LOCAL_TEST
using namespace std;
// 型名の短縮
using ll = long long;
using pii = pair<int, int>; using pll = pair<ll, ll>;
using vi = vector<int>;  using vvi = vector<vi>; using vvvi = vector<vvi>;
using vl = vector<ll>;  using vvl = vector<vl>; using vvvl = vector<vvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using vs = vector<string>; using vvs = vector<vector<string>>; using vvvs = vector<vector<vector<string>>>;
template<typename T> vector<vector<T>> vv(int h, int w, T val = T()) { return vector(h, vector<T>(w, val)); }
template<typename T> vector<vector<vector<T>>> vvv(int h1, int h2, int h3, T val = T()) { return vector(h1, vector(h2, vector<T>(h3, val))); }
template<typename T> vector<vector<vector<vector<T>>>> vvvv(int h1, int h2, int h3, int h4, T val = T()) { return vector(h1, vector(h2, vector(h3, vector<T>(h4, val)))); }
template <class T> using priority_queue_min = priority_queue<T, vector<T>, greater<T>>;
// 定数の定義
constexpr double PI = 3.14159265358979323;
constexpr int INF = 100100111; constexpr ll INFL = 3300300300300300491LL;
float EPS = 1e-8; double EPSL = 1e-16;
template<typename T> bool eq(const T x, const T y) { return x == y; }
template<> bool eq<double>(const double x, const double y) { return abs(x - y) < EPSL; }
template<> bool eq<float>(const float x, const float y) { return abs(x - y) < EPS; }
template<typename T> bool neq(const T x, const T y) { return !(eq<T>(x, y)); }
template<typename T> bool ge(const T x, const T y) { return (eq<T>(x, y) || (x > y)); }
template<typename T> bool le(const T x, const T y) { return (eq<T>(x, y) || (x < y)); }
template<typename T> bool gt(const T x, const T y) { return !(le<T>(x, y)); }
template<typename T> bool lt(const T x, const T y) { return !(ge<T>(x, y)); }
constexpr int MODINT998244353 = 998244353;
constexpr int MODINT1000000007 = 1000000007;
// 入出力高速化
struct Nyan { Nyan() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } nyan;
// 汎用マクロの定義
#define all(a) (a).begin(), (a).end()
#define sz(x) ((ll)(x).size())
#define rep1(n) for(ll dummy_iter = 0LL; dummy_iter < n; ++dummy_iter) // 0 から n-1 まで昇順
#define rep2(i, n) for(ll i = 0LL, i##_counter = 0LL; i##_counter < ll(n); ++(i##_counter), (i) = i##_counter) // 0 から n-1 まで昇順
#define rep3(i, s, t) for(ll i = ll(s), i##_counter = ll(s); i##_counter < ll(t); ++(i##_counter), (i) = (i##_counter)) // s から t まで昇順
#define rep4(i, s, t, step) for(ll i##_counter = step > 0 ? ll(s) : -ll(s), i##_end = step > 0 ? ll(t) : -ll(t), i##_step = abs(step), i = ll(s); i##_counter < i##_end; i##_counter += i##_step, i = step > 0 ? i##_counter : -i##_counter) // s から t まで stepずつ
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define repe(a, v) for(auto& a : (v)) // v の全要素（変更可能）
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod
#define sdiv(n, m) (((n) - smod(n, m)) / (m)) // 非負div
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去
int Yes(bool b=true) { cout << (b ? "Yes\n" : "No\n"); return 0; };
int YES(bool b=true) { cout << (b ? "YES\n" : "NO\n"); return 0; };
int No(bool b=true) {return Yes(!b);};
int NO(bool b=true) {return YES(!b);};
template<typename T, size_t N> T max(array<T, N>& a) { return *max_element(all(a)); };
template<typename T, size_t N> T min(array<T, N>& a) { return *min_element(all(a)); };
template<typename T> T max(vector<T>& a) { return *max_element(all(a)); };
template<typename T> T min(vector<T>& a) { return *min_element(all(a)); };
template<typename T> vector<T> vec_slice(const vector<T>& a, int l, int r) { vector<T> rev; rep(i, l, r) rev.push_back(a[i]); return rev; };
template<typename T> T sum(vector<T>& a, T zero = T(0)) { T rev = zero; rep(i, sz(a)) rev += a[i]; return rev; };
template<typename T> bool in_range(const T& val, const T& s, const T& t) { return s <= val && val < t; };

template <class T> inline vector<T>& operator--(vector<T>& v) { repe(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repe(x, v) ++x; return v; }

// modでのpow
ll powm(ll a, ll n, ll mod=INFL) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = (res * a) % mod;
        if (n > 1) a = (a * a) % mod;
        n >>= 1;
    }
    return res;
}
// 整数Sqrt
ll sqrtll(ll x) {
    assert(x >= 0);
    ll rev = sqrt(x);
    while(rev * rev > x) --rev;
    while((rev+1) * (rev+1)<=x) ++rev;
    return rev;
}
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）
int digit(ll x, int d=10) { int rev=0; while (x > 0) { rev++; x /= d;}; return rev; } // xのd進数桁数
/**
 * @brief std.hpp
 * @docs docs/std/std.md
 */
#line 3 "competitive/string/rolling_hash.hpp"
using hash_t = unsigned long long;
using hash_vector_t = vector<hash_t>;
constexpr hash_t RHMOD = (1UL << 61) - 1;
constexpr hash_t RHR = 37;

namespace internal {
    const hash_t MASK30 = (1UL << 30) - 1;
    const hash_t MASK31 = (1UL << 31) - 1;
    const hash_t MASK61 = RHMOD;

    //mod 2^61-1を計算する関数
    hash_t CalcMod(hash_t x) {
        hash_t xu = x >> 61;
        hash_t xd = x & MASK61;
        hash_t res = xu + xd;
        if (res >= RHMOD) res -= RHMOD;
        return res;
    }

    //a*b mod 2^61-1を返す関数(最後にModを取る)
    hash_t Mul(hash_t a, hash_t b) {
        hash_t au = a >> 31;
        hash_t ad = a & MASK31;
        hash_t bu = b >> 31;
        hash_t bd = b & MASK31;
        hash_t mid = ad * bu + au * bd;
        hash_t midu = mid >> 30;
        hash_t midd = mid & MASK30;
        return CalcMod(au * bu * 2 + midu + (midd << 31) + ad * bd);
    }

    hash_t Pow(hash_t a, hash_t n) {
        hash_t res = 1;
        while (n > 0) {
            if (n & 1) res = Mul(res, a);
            a = Mul(a, a);
            n >>= 1;
        }
        return res;
    }
}

struct RollingHash {
    private:
    static bool initialized;
    static int hash_size;

    public:
    static vector<hash_t> base;
    static vector<hash_t> base_inv;
    vector<hash_vector_t> cum;
    template<typename T> RollingHash(vector<T> &a, int hash_size=3, ll maxa=1e9) {
        if(!initialized) (*this).init_base(hash_size, maxa);
        (*this).calc(a);
    };
    RollingHash(string &a, int hash_size=3, ll maxa=1e9) {
        if(!initialized) (*this).init_base(hash_size, maxa);
        (*this).calc(a);
    }

    void init_base(int hash_size, ll maxa) {
        (*this).hash_size = hash_size;
        random_device seed_gen;
        mt19937 engine(seed_gen());
        while (sz(base) < hash_size) {
            hash_t k = 0;
            hash_t b = internal::Pow(RHR, k);
            while (b <= maxa || gcd(RHMOD-1, b) != 1) {
                k = engine();
                b = internal::Pow(RHR, k);
            }
            base.push_back(b);
            base_inv.push_back(internal::Pow(b, RHMOD-2));
        }
        initialized = true;
    }

    template<typename T> void calc(vector<T> const &a) {
        cum = vector<hash_vector_t>(sz(a)+1, vector<hash_t>(hash_size, 0));
        rep(i, hash_size) {
            hash_t base_pow = 1;
            rep(j, sz(a)) {
                cum[j+1][i] = internal::CalcMod(cum[j][i] + internal::Mul(a[j], base_pow));
                base_pow = internal::Mul(base_pow, (*this).base[i]);
            }
        }
    }

    void calc(string const &a) {
        vector<char> _a(a.begin(), a.end());
        calc(_a);
    };

    vector<hash_t> query(int l, int r) {
        assert(l <= r);
        assert(0 <= l && r < sz(cum));
        vector<hash_t> rev(hash_size);
        rep(i, hash_size) {
            rev[i] = internal::Mul(cum[r][i] + RHMOD - cum[l][i], internal::Pow((*this).base_inv[i], l));
        }
        return rev;
    }

    template <class T> vector<hash_vector_t> calc_hash(vector<T> const &a, int k){
        assert(sz(a) >= k);
        vector<hash_vector_t> res(sz(a) - k + 1, vector<hash_t>(hash_size));
        vector<hash_t> base_pow(hash_size);
        rep(i, hash_size) base_pow[i] = internal::Pow(this->base[i], k);

        rep(i, hash_size) {
            // 先頭のハッシュ計算
            hash_t b = this->base[i];
            hash_t sh = 0;
            rep(j, k){ sh = internal::CalcMod(internal::Mul(sh, b) + a[j]); }
            res[0][i] = sh;

            // sをずらしてハッシュ値を更新
            rep(j, sz(a) - k){
                sh = internal::CalcMod(internal::Mul(sh, b) + a[j+k] + RHMOD - internal::Mul(a[j], base_pow[i]));
                res[j+1][i] = sh;
            }
        }
        return res;
    }

    vector<hash_vector_t> calc_hash(string const &a, int k) {
        vector<char> _a(a.begin(), a.end());
        return calc_hash(_a, k);
    };
};
bool RollingHash::initialized = false;
int RollingHash::hash_size = 3;
vector<hash_t> RollingHash::base(0);
vector<hash_t> RollingHash::base_inv(0);
/**
 * @brief rolling_hash.hpp
 * @docs docs/string/rolling_hash.md
 */
#line 3 "competitive/std/io.hpp"
// 演算子オーバーロード（プロトタイプ宣言）
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p);
template <class T> inline istream& operator>>(istream& is, vector<T>& v);
template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p);
template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v);
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp);
template <typename T> ostream &operator<<(ostream &os, const set<T> &st);
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st);
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st);
template <typename T> ostream &operator<<(ostream &os, queue<T> q);
template <typename T> ostream &operator<<(ostream &os, deque<T> q);
template <typename T> ostream &operator<<(ostream &os, stack<T> st);
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq);

// 演算子オーバーロード
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repe(x, v) is >> x; return is; }
template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.first << " " << p.second; return os; }
template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v) { rep(i, sz(v)) { os << v.at(i); if (i != sz(v) - 1) os << " "; } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp) { for (auto &[key, val] : mp) { os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st) { ll cnt = 0; for (auto &e : st) { os << e << (++cnt != (int)st.size() ? " " : ""); } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q) { while (q.size()) { os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q) { while (q.size()) { os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st) { while (st.size()) { os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) { while (pq.size()) { os << pq.top() << " "; pq.pop(); } return os; }

template <typename T> int print_sep_end(string sep, string end, const T& val) { (void)sep; cout << val << end; return 0; };
template <typename T1, typename... T2> int print_sep_end(string sep, string end, const T1 &val, const T2 &...remain) {
    cout << val << sep;
    print_sep_end(sep, end, remain...);
    return 0;
};
template <typename... T> int print(const T &...args) { print_sep_end(" ", "\n", args...); return 0; };
template <typename... T> void flush() { cout << flush; };
template <typename... T> int print_and_flush(const T &...args) { print(args...); flush(); return 0; };
#define debug(...) debug_func(0, #__VA_ARGS__, __VA_ARGS__) // debug print
template <typename T> void input(T &a) { cin >> a; };
template <typename T1, typename... T2> void input(T1&a, T2 &...b) { cin >> a; input(b...); };
#ifdef LOCAL_TEST
template <typename T> void debug_func(int i, const T name) { (void)i; (void)name; cerr << endl; }
template <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, const T2 &a, const T3 &...b) {
    int scope = 0;
    for ( ; (scope != 0 || name[i] != ',') && name[i] != '\0'; i++ ) {
        cerr << name[i];
        if (name[i] == '(' || name[i] == '{') scope++;
        if (name[i] == ')' || name[i] == '}') scope--;
    }
    cerr << ":" << a << " ";
    debug_func(i + 1, name, b...);
}
template <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, T2 &a, T3 &...b) {
    int scope = 0;
    for ( ; (scope != 0 || name[i] != ',') && name[i] != '\0'; i++ ) {
        cerr << name[i];
        if (name[i] == '(' || name[i] == '{') scope++;
        if (name[i] == ')' || name[i] == '}') scope--;
    }
    cerr << ":" << a << " ";
    debug_func(i + 1, name, b...);
}
#endif
#ifndef LOCAL_TEST
template <typename... T>
void debug_func(T &...) {}
template <typename... T>
void debug_func(const T &...) {}
#endif
/**
 * @brief io.hpp
 * @docs docs/std/io.md
 */
#line 5 "online_test/AOJ/ALDS_1_14_B.test.cpp"

int main() {
    string s, t;
    cin >> s >> t;
    int n = sz(s);
    int m = sz(t);
    RollingHash rhs(s, 4);
    RollingHash rht(t);
    auto th = rht.query(0, m);
    rep(i, n-m+1) {
        if (rht.query(0, m) == rhs.query(i, i+m)) print(i);
    }
}
Back to top page