結果
問題 | No.2626 Similar But Different Name |
ユーザー |
|
提出日時 | 2024-02-09 22:40:27 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 436 ms / 3,000 ms |
コード長 | 38,274 bytes |
コンパイル時間 | 3,473 ms |
コンパイル使用メモリ | 253,868 KB |
実行使用メモリ | 64,096 KB |
最終ジャッジ日時 | 2024-09-28 15:51:43 |
合計ジャッジ時間 | 10,633 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 35 |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:36:9: warning: 'tindex' may be used uninitialized [-Wmaybe-uninitialized] 36 | int rx = x + k < n ? rnk[x + k] : -1; | ^ ~~
ソースコード
#line 1 "main.cpp"#include <algorithm>#include <cassert>#include <numeric>#include <string>#include <vector>namespace atcoder {namespace internal {std::vector<int> sa_naive(const std::vector<int>& s) {int n = int(s.size());std::vector<int> sa(n);std::iota(sa.begin(), sa.end(), 0);std::sort(sa.begin(), sa.end(), [&](int l, int r) {if (l == r) return false;while (l < n && r < n) {if (s[l] != s[r]) return s[l] < s[r];l++;r++;}return l == n;});return sa;}std::vector<int> sa_doubling(const std::vector<int>& s) {int n = int(s.size());std::vector<int> sa(n), rnk = s, tmp(n);std::iota(sa.begin(), sa.end(), 0);for (int k = 1; k < n; k *= 2) {auto cmp = [&](int x, int y) {if (rnk[x] != rnk[y]) return rnk[x] < rnk[y];int rx = x + k < n ? rnk[x + k] : -1;int ry = y + k < n ? rnk[y + k] : -1;return rx < ry;};std::sort(sa.begin(), sa.end(), cmp);tmp[sa[0]] = 0;for (int i = 1; i < n; i++) {tmp[sa[i]] = tmp[sa[i - 1]] + (cmp(sa[i - 1], sa[i]) ? 1 : 0);}std::swap(tmp, rnk);}return sa;}template <int THRESHOLD_NAIVE = 10, int THRESHOLD_DOUBLING = 40>std::vector<int> sa_is(const std::vector<int>& s, int upper) {int n = int(s.size());if (n == 0) return {};if (n == 1) return {0};if (n == 2) {if (s[0] < s[1]) {return {0, 1};} else {return {1, 0};}}if (n < THRESHOLD_NAIVE) {return sa_naive(s);}if (n < THRESHOLD_DOUBLING) {return sa_doubling(s);}std::vector<int> sa(n);std::vector<bool> ls(n);for (int i = n - 2; i >= 0; i--) {ls[i] = (s[i] == s[i + 1]) ? ls[i + 1] : (s[i] < s[i + 1]);}std::vector<int> sum_l(upper + 1), sum_s(upper + 1);for (int i = 0; i < n; i++) {if (!ls[i]) {sum_s[s[i]]++;} else {sum_l[s[i] + 1]++;}}for (int i = 0; i <= upper; i++) {sum_s[i] += sum_l[i];if (i < upper) sum_l[i + 1] += sum_s[i];}auto induce = [&](const std::vector<int>& lms) {std::fill(sa.begin(), sa.end(), -1);std::vector<int> buf(upper + 1);std::copy(sum_s.begin(), sum_s.end(), buf.begin());for (auto d : lms) {if (d == n) continue;sa[buf[s[d]]++] = d;}std::copy(sum_l.begin(), sum_l.end(), buf.begin());sa[buf[s[n - 1]]++] = n - 1;for (int i = 0; i < n; i++) {int v = sa[i];if (v >= 1 && !ls[v - 1]) {sa[buf[s[v - 1]]++] = v - 1;}}std::copy(sum_l.begin(), sum_l.end(), buf.begin());for (int i = n - 1; i >= 0; i--) {int v = sa[i];if (v >= 1 && ls[v - 1]) {sa[--buf[s[v - 1] + 1]] = v - 1;}}};std::vector<int> lms_map(n + 1, -1);int m = 0;for (int i = 1; i < n; i++) {if (!ls[i - 1] && ls[i]) {lms_map[i] = m++;}}std::vector<int> lms;lms.reserve(m);for (int i = 1; i < n; i++) {if (!ls[i - 1] && ls[i]) {lms.push_back(i);}}induce(lms);if (m) {std::vector<int> sorted_lms;sorted_lms.reserve(m);for (int v : sa) {if (lms_map[v] != -1) sorted_lms.push_back(v);}std::vector<int> rec_s(m);int rec_upper = 0;rec_s[lms_map[sorted_lms[0]]] = 0;for (int i = 1; i < m; i++) {int l = sorted_lms[i - 1], r = sorted_lms[i];int end_l = (lms_map[l] + 1 < m) ? lms[lms_map[l] + 1] : n;int end_r = (lms_map[r] + 1 < m) ? lms[lms_map[r] + 1] : n;bool same = true;if (end_l - l != end_r - r) {same = false;} else {while (l < end_l) {if (s[l] != s[r]) {break;}l++;r++;}if (l == n || s[l] != s[r]) same = false;}if (!same) rec_upper++;rec_s[lms_map[sorted_lms[i]]] = rec_upper;}auto rec_sa =sa_is<THRESHOLD_NAIVE, THRESHOLD_DOUBLING>(rec_s, rec_upper);for (int i = 0; i < m; i++) {sorted_lms[i] = lms[rec_sa[i]];}induce(sorted_lms);}return sa;}} // namespace internalstd::vector<int> suffix_array(const std::vector<int>& s, int upper) {assert(0 <= upper);for (int d : s) {assert(0 <= d && d <= upper);}auto sa = internal::sa_is(s, upper);return sa;}template <class T> std::vector<int> suffix_array(const std::vector<T>& s) {int n = int(s.size());std::vector<int> idx(n);iota(idx.begin(), idx.end(), 0);sort(idx.begin(), idx.end(), [&](int l, int r) { return s[l] < s[r]; });std::vector<int> s2(n);int now = 0;for (int i = 0; i < n; i++) {if (i && s[idx[i - 1]] != s[idx[i]]) now++;s2[idx[i]] = now;}return internal::sa_is(s2, now);}std::vector<int> suffix_array(const std::string& s) {int n = int(s.size());std::vector<int> s2(n);for (int i = 0; i < n; i++) {s2[i] = s[i];}return internal::sa_is(s2, 255);}template <class T>std::vector<int> lcp_array(const std::vector<T>& s,const std::vector<int>& sa) {int n = int(s.size());assert(n >= 1);std::vector<int> rnk(n);for (int i = 0; i < n; i++) {rnk[sa[i]] = i;}std::vector<int> lcp(n - 1);int h = 0;for (int i = 0; i < n; i++) {if (h > 0) h--;if (rnk[i] == 0) continue;int j = sa[rnk[i] - 1];for (; j + h < n && i + h < n; h++) {if (s[j + h] != s[i + h]) break;}lcp[rnk[i] - 1] = h;}return lcp;}std::vector<int> lcp_array(const std::string& s, const std::vector<int>& sa) {int n = int(s.size());std::vector<int> s2(n);for (int i = 0; i < n; i++) {s2[i] = s[i];}return lcp_array(s2, sa);}template <class T> std::vector<int> z_algorithm(const std::vector<T>& s) {int n = int(s.size());if (n == 0) return {};std::vector<int> z(n);z[0] = 0;for (int i = 1, j = 0; i < n; i++) {int& k = z[i];k = (j + z[j] <= i) ? 0 : std::min(j + z[j] - i, z[i - j]);while (i + k < n && s[k] == s[i + k]) k++;if (j + z[j] < i + z[i]) j = i;}z[0] = n;return z;}std::vector<int> z_algorithm(const std::string& s) {int n = int(s.size());std::vector<int> s2(n);for (int i = 0; i < n; i++) {s2[i] = s[i];}return z_algorithm(s2);}} // namespace atcoder#include <algorithm>#include <array>#include <cassert>#include <type_traits>#include <vector>#ifdef _MSC_VER#include <intrin.h>#endif#if __cplusplus >= 202002L#include <bit>#endifnamespace atcoder {namespace internal {#if __cplusplus >= 202002Lusing std::bit_ceil;#elseunsigned int bit_ceil(unsigned int n) {unsigned int x = 1;while (x < (unsigned int)(n)) x *= 2;return x;}#endifint countr_zero(unsigned int n) {#ifdef _MSC_VERunsigned long index;_BitScanForward(&index, n);return index;#elsereturn __builtin_ctz(n);#endif}constexpr int countr_zero_constexpr(unsigned int n) {int x = 0;while (!(n & (1 << x))) x++;return x;}} // namespace internal} // namespace atcoder#include <cassert>#include <numeric>#include <type_traits>#ifdef _MSC_VER#include <intrin.h>#endif#include <utility>#ifdef _MSC_VER#include <intrin.h>#endifnamespace atcoder {namespace internal {constexpr long long safe_mod(long long x, long long m) {x %= m;if (x < 0) x += m;return x;}struct barrett {unsigned int _m;unsigned long long im;explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}unsigned int umod() const { return _m; }unsigned int mul(unsigned int a, unsigned int b) const {unsigned long long z = a;z *= b;#ifdef _MSC_VERunsigned long long x;_umul128(z, im, &x);#elseunsigned long long x =(unsigned long long)(((unsigned __int128)(z)*im) >> 64);#endifunsigned long long y = x * _m;return (unsigned int)(z - y + (z < y ? _m : 0));}};constexpr long long pow_mod_constexpr(long long x, long long n, int m) {if (m == 1) return 0;unsigned int _m = (unsigned int)(m);unsigned long long r = 1;unsigned long long y = safe_mod(x, m);while (n) {if (n & 1) r = (r * y) % _m;y = (y * y) % _m;n >>= 1;}return r;}constexpr bool is_prime_constexpr(int n) {if (n <= 1) return false;if (n == 2 || n == 7 || n == 61) return true;if (n % 2 == 0) return false;long long d = n - 1;while (d % 2 == 0) d /= 2;constexpr long long bases[3] = {2, 7, 61};for (long long a : bases) {long long t = d;long long y = pow_mod_constexpr(a, t, n);while (t != n - 1 && y != 1 && y != n - 1) {y = y * y % n;t <<= 1;}if (y != n - 1 && t % 2 == 0) {return false;}}return true;}template <int n> constexpr bool is_prime = is_prime_constexpr(n);constexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {a = safe_mod(a, b);if (a == 0) return {b, 0};long long s = b, t = a;long long m0 = 0, m1 = 1;while (t) {long long u = s / t;s -= t * u;m0 -= m1 * u; // |m1 * u| <= |m1| * s <= bauto tmp = s;s = t;t = tmp;tmp = m0;m0 = m1;m1 = tmp;}if (m0 < 0) m0 += b / s;return {s, m0};}constexpr int primitive_root_constexpr(int m) {if (m == 2) return 1;if (m == 167772161) return 3;if (m == 469762049) return 3;if (m == 754974721) return 11;if (m == 998244353) return 3;int divs[20] = {};divs[0] = 2;int cnt = 1;int x = (m - 1) / 2;while (x % 2 == 0) x /= 2;for (int i = 3; (long long)(i)*i <= x; i += 2) {if (x % i == 0) {divs[cnt++] = i;while (x % i == 0) {x /= i;}}}if (x > 1) {divs[cnt++] = x;}for (int g = 2;; g++) {bool ok = true;for (int i = 0; i < cnt; i++) {if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {ok = false;break;}}if (ok) return g;}}template <int m> constexpr int primitive_root = primitive_root_constexpr(m);unsigned long long floor_sum_unsigned(unsigned long long n,unsigned long long m,unsigned long long a,unsigned long long b) {unsigned long long ans = 0;while (true) {if (a >= m) {ans += n * (n - 1) / 2 * (a / m);a %= m;}if (b >= m) {ans += n * (b / m);b %= m;}unsigned long long y_max = a * n + b;if (y_max < m) break;n = (unsigned long long)(y_max / m);b = (unsigned long long)(y_max % m);std::swap(m, a);}return ans;}} // namespace internal} // namespace atcoder#include <cassert>#include <numeric>#include <type_traits>namespace atcoder {namespace internal {#ifndef _MSC_VERtemplate <class T>using is_signed_int128 =typename std::conditional<std::is_same<T, __int128_t>::value ||std::is_same<T, __int128>::value,std::true_type,std::false_type>::type;template <class T>using is_unsigned_int128 =typename std::conditional<std::is_same<T, __uint128_t>::value ||std::is_same<T, unsigned __int128>::value,std::true_type,std::false_type>::type;template <class T>using make_unsigned_int128 =typename std::conditional<std::is_same<T, __int128_t>::value,__uint128_t,unsigned __int128>;template <class T>using is_integral = typename std::conditional<std::is_integral<T>::value ||is_signed_int128<T>::value ||is_unsigned_int128<T>::value,std::true_type,std::false_type>::type;template <class T>using is_signed_int = typename std::conditional<(is_integral<T>::value &&std::is_signed<T>::value) ||is_signed_int128<T>::value,std::true_type,std::false_type>::type;template <class T>using is_unsigned_int =typename std::conditional<(is_integral<T>::value &&std::is_unsigned<T>::value) ||is_unsigned_int128<T>::value,std::true_type,std::false_type>::type;template <class T>using to_unsigned = typename std::conditional<is_signed_int128<T>::value,make_unsigned_int128<T>,typename std::conditional<std::is_signed<T>::value,std::make_unsigned<T>,std::common_type<T>>::type>::type;#elsetemplate <class T> using is_integral = typename std::is_integral<T>;template <class T>using is_signed_int =typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,std::true_type,std::false_type>::type;template <class T>using is_unsigned_int =typename std::conditional<is_integral<T>::value &&std::is_unsigned<T>::value,std::true_type,std::false_type>::type;template <class T>using to_unsigned = typename std::conditional<is_signed_int<T>::value,std::make_unsigned<T>,std::common_type<T>>::type;#endiftemplate <class T>using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;template <class T>using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;template <class T> using to_unsigned_t = typename to_unsigned<T>::type;} // namespace internal} // namespace atcodernamespace atcoder {namespace internal {struct modint_base {};struct static_modint_base : modint_base {};template <class T> using is_modint = std::is_base_of<modint_base, T>;template <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;} // namespace internaltemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>struct static_modint : internal::static_modint_base {using mint = static_modint;public:static constexpr int mod() { return m; }static mint raw(int v) {mint x;x._v = v;return x;}static_modint() : _v(0) {}template <class T, internal::is_signed_int_t<T>* = nullptr>static_modint(T v) {long long x = (long long)(v % (long long)(umod()));if (x < 0) x += umod();_v = (unsigned int)(x);}template <class T, internal::is_unsigned_int_t<T>* = nullptr>static_modint(T v) {_v = (unsigned int)(v % umod());}unsigned int val() const { return _v; }mint& operator++() {_v++;if (_v == umod()) _v = 0;return *this;}mint& operator--() {if (_v == 0) _v = umod();_v--;return *this;}mint operator++(int) {mint result = *this;++*this;return result;}mint operator--(int) {mint result = *this;--*this;return result;}mint& operator+=(const mint& rhs) {_v += rhs._v;if (_v >= umod()) _v -= umod();return *this;}mint& operator-=(const mint& rhs) {_v -= rhs._v;if (_v >= umod()) _v += umod();return *this;}mint& operator*=(const mint& rhs) {unsigned long long z = _v;z *= rhs._v;_v = (unsigned int)(z % umod());return *this;}mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }mint operator+() const { return *this; }mint operator-() const { return mint() - *this; }mint pow(long long n) const {assert(0 <= n);mint x = *this, r = 1;while (n) {if (n & 1) r *= x;x *= x;n >>= 1;}return r;}mint inv() const {if (prime) {assert(_v);return pow(umod() - 2);} else {auto eg = internal::inv_gcd(_v, m);assert(eg.first == 1);return eg.second;}}friend mint operator+(const mint& lhs, const mint& rhs) {return mint(lhs) += rhs;}friend mint operator-(const mint& lhs, const mint& rhs) {return mint(lhs) -= rhs;}friend mint operator*(const mint& lhs, const mint& rhs) {return mint(lhs) *= rhs;}friend mint operator/(const mint& lhs, const mint& rhs) {return mint(lhs) /= rhs;}friend bool operator==(const mint& lhs, const mint& rhs) {return lhs._v == rhs._v;}friend bool operator!=(const mint& lhs, const mint& rhs) {return lhs._v != rhs._v;}private:unsigned int _v;static constexpr unsigned int umod() { return m; }static constexpr bool prime = internal::is_prime<m>;};template <int id> struct dynamic_modint : internal::modint_base {using mint = dynamic_modint;public:static int mod() { return (int)(bt.umod()); }static void set_mod(int m) {assert(1 <= m);bt = internal::barrett(m);}static mint raw(int v) {mint x;x._v = v;return x;}dynamic_modint() : _v(0) {}template <class T, internal::is_signed_int_t<T>* = nullptr>dynamic_modint(T v) {long long x = (long long)(v % (long long)(mod()));if (x < 0) x += mod();_v = (unsigned int)(x);}template <class T, internal::is_unsigned_int_t<T>* = nullptr>dynamic_modint(T v) {_v = (unsigned int)(v % mod());}unsigned int val() const { return _v; }mint& operator++() {_v++;if (_v == umod()) _v = 0;return *this;}mint& operator--() {if (_v == 0) _v = umod();_v--;return *this;}mint operator++(int) {mint result = *this;++*this;return result;}mint operator--(int) {mint result = *this;--*this;return result;}mint& operator+=(const mint& rhs) {_v += rhs._v;if (_v >= umod()) _v -= umod();return *this;}mint& operator-=(const mint& rhs) {_v += mod() - rhs._v;if (_v >= umod()) _v -= umod();return *this;}mint& operator*=(const mint& rhs) {_v = bt.mul(_v, rhs._v);return *this;}mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }mint operator+() const { return *this; }mint operator-() const { return mint() - *this; }mint pow(long long n) const {assert(0 <= n);mint x = *this, r = 1;while (n) {if (n & 1) r *= x;x *= x;n >>= 1;}return r;}mint inv() const {auto eg = internal::inv_gcd(_v, mod());assert(eg.first == 1);return eg.second;}friend mint operator+(const mint& lhs, const mint& rhs) {return mint(lhs) += rhs;}friend mint operator-(const mint& lhs, const mint& rhs) {return mint(lhs) -= rhs;}friend mint operator*(const mint& lhs, const mint& rhs) {return mint(lhs) *= rhs;}friend mint operator/(const mint& lhs, const mint& rhs) {return mint(lhs) /= rhs;}friend bool operator==(const mint& lhs, const mint& rhs) {return lhs._v == rhs._v;}friend bool operator!=(const mint& lhs, const mint& rhs) {return lhs._v != rhs._v;}private:unsigned int _v;static internal::barrett bt;static unsigned int umod() { return bt.umod(); }};template <int id> internal::barrett dynamic_modint<id>::bt(998244353);using modint998244353 = static_modint<998244353>;using modint1000000007 = static_modint<1000000007>;using modint = dynamic_modint<-1>;namespace internal {template <class T>using is_static_modint = std::is_base_of<internal::static_modint_base, T>;template <class T>using is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;template <class> struct is_dynamic_modint : public std::false_type {};template <int id>struct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};template <class T>using is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;} // namespace internal} // namespace atcodernamespace atcoder {namespace internal {template <class mint,int g = internal::primitive_root<mint::mod()>,internal::is_static_modint_t<mint>* = nullptr>struct fft_info {static constexpr int rank2 = countr_zero_constexpr(mint::mod() - 1);std::array<mint, rank2 + 1> root; // root[i]^(2^i) == 1std::array<mint, rank2 + 1> iroot; // root[i] * iroot[i] == 1std::array<mint, std::max(0, rank2 - 2 + 1)> rate2;std::array<mint, std::max(0, rank2 - 2 + 1)> irate2;std::array<mint, std::max(0, rank2 - 3 + 1)> rate3;std::array<mint, std::max(0, rank2 - 3 + 1)> irate3;fft_info() {root[rank2] = mint(g).pow((mint::mod() - 1) >> rank2);iroot[rank2] = root[rank2].inv();for (int i = rank2 - 1; i >= 0; i--) {root[i] = root[i + 1] * root[i + 1];iroot[i] = iroot[i + 1] * iroot[i + 1];}{mint prod = 1, iprod = 1;for (int i = 0; i <= rank2 - 2; i++) {rate2[i] = root[i + 2] * prod;irate2[i] = iroot[i + 2] * iprod;prod *= iroot[i + 2];iprod *= root[i + 2];}}{mint prod = 1, iprod = 1;for (int i = 0; i <= rank2 - 3; i++) {rate3[i] = root[i + 3] * prod;irate3[i] = iroot[i + 3] * iprod;prod *= iroot[i + 3];iprod *= root[i + 3];}}}};template <class mint, internal::is_static_modint_t<mint>* = nullptr>void butterfly(std::vector<mint>& a) {int n = int(a.size());int h = internal::countr_zero((unsigned int)n);static const fft_info<mint> info;int len = 0; // a[i, i+(n>>len), i+2*(n>>len), ..] is transformedwhile (len < h) {if (h - len == 1) {int p = 1 << (h - len - 1);mint rot = 1;for (int s = 0; s < (1 << len); s++) {int offset = s << (h - len);for (int i = 0; i < p; i++) {auto l = a[i + offset];auto r = a[i + offset + p] * rot;a[i + offset] = l + r;a[i + offset + p] = l - r;}if (s + 1 != (1 << len))rot *= info.rate2[countr_zero(~(unsigned int)(s))];}len++;} else {int p = 1 << (h - len - 2);mint rot = 1, imag = info.root[2];for (int s = 0; s < (1 << len); s++) {mint rot2 = rot * rot;mint rot3 = rot2 * rot;int offset = s << (h - len);for (int i = 0; i < p; i++) {auto mod2 = 1ULL * mint::mod() * mint::mod();auto a0 = 1ULL * a[i + offset].val();auto a1 = 1ULL * a[i + offset + p].val() * rot.val();auto a2 = 1ULL * a[i + offset + 2 * p].val() * rot2.val();auto a3 = 1ULL * a[i + offset + 3 * p].val() * rot3.val();auto a1na3imag =1ULL * mint(a1 + mod2 - a3).val() * imag.val();auto na2 = mod2 - a2;a[i + offset] = a0 + a2 + a1 + a3;a[i + offset + 1 * p] = a0 + a2 + (2 * mod2 - (a1 + a3));a[i + offset + 2 * p] = a0 + na2 + a1na3imag;a[i + offset + 3 * p] = a0 + na2 + (mod2 - a1na3imag);}if (s + 1 != (1 << len))rot *= info.rate3[countr_zero(~(unsigned int)(s))];}len += 2;}}}template <class mint, internal::is_static_modint_t<mint>* = nullptr>void butterfly_inv(std::vector<mint>& a) {int n = int(a.size());int h = internal::countr_zero((unsigned int)n);static const fft_info<mint> info;int len = h; // a[i, i+(n>>len), i+2*(n>>len), ..] is transformedwhile (len) {if (len == 1) {int p = 1 << (h - len);mint irot = 1;for (int s = 0; s < (1 << (len - 1)); s++) {int offset = s << (h - len + 1);for (int i = 0; i < p; i++) {auto l = a[i + offset];auto r = a[i + offset + p];a[i + offset] = l + r;a[i + offset + p] =(unsigned long long)(mint::mod() + l.val() - r.val()) *irot.val();;}if (s + 1 != (1 << (len - 1)))irot *= info.irate2[countr_zero(~(unsigned int)(s))];}len--;} else {int p = 1 << (h - len);mint irot = 1, iimag = info.iroot[2];for (int s = 0; s < (1 << (len - 2)); s++) {mint irot2 = irot * irot;mint irot3 = irot2 * irot;int offset = s << (h - len + 2);for (int i = 0; i < p; i++) {auto a0 = 1ULL * a[i + offset + 0 * p].val();auto a1 = 1ULL * a[i + offset + 1 * p].val();auto a2 = 1ULL * a[i + offset + 2 * p].val();auto a3 = 1ULL * a[i + offset + 3 * p].val();auto a2na3iimag =1ULL *mint((mint::mod() + a2 - a3) * iimag.val()).val();a[i + offset] = a0 + a1 + a2 + a3;a[i + offset + 1 * p] =(a0 + (mint::mod() - a1) + a2na3iimag) * irot.val();a[i + offset + 2 * p] =(a0 + a1 + (mint::mod() - a2) + (mint::mod() - a3)) *irot2.val();a[i + offset + 3 * p] =(a0 + (mint::mod() - a1) + (mint::mod() - a2na3iimag)) *irot3.val();}if (s + 1 != (1 << (len - 2)))irot *= info.irate3[countr_zero(~(unsigned int)(s))];}len -= 2;}}}template <class mint, internal::is_static_modint_t<mint>* = nullptr>std::vector<mint> convolution_naive(const std::vector<mint>& a,const std::vector<mint>& b) {int n = int(a.size()), m = int(b.size());std::vector<mint> ans(n + m - 1);if (n < m) {for (int j = 0; j < m; j++) {for (int i = 0; i < n; i++) {ans[i + j] += a[i] * b[j];}}} else {for (int i = 0; i < n; i++) {for (int j = 0; j < m; j++) {ans[i + j] += a[i] * b[j];}}}return ans;}template <class mint, internal::is_static_modint_t<mint>* = nullptr>std::vector<mint> convolution_fft(std::vector<mint> a, std::vector<mint> b) {int n = int(a.size()), m = int(b.size());int z = (int)internal::bit_ceil((unsigned int)(n + m - 1));a.resize(z);internal::butterfly(a);b.resize(z);internal::butterfly(b);for (int i = 0; i < z; i++) {a[i] *= b[i];}internal::butterfly_inv(a);a.resize(n + m - 1);mint iz = mint(z).inv();for (int i = 0; i < n + m - 1; i++) a[i] *= iz;return a;}} // namespace internaltemplate <class mint, internal::is_static_modint_t<mint>* = nullptr>std::vector<mint> convolution(std::vector<mint>&& a, std::vector<mint>&& b) {int n = int(a.size()), m = int(b.size());if (!n || !m) return {};int z = (int)internal::bit_ceil((unsigned int)(n + m - 1));assert((mint::mod() - 1) % z == 0);if (std::min(n, m) <= 60) return convolution_naive(a, b);return internal::convolution_fft(a, b);}template <class mint, internal::is_static_modint_t<mint>* = nullptr>std::vector<mint> convolution(const std::vector<mint>& a,const std::vector<mint>& b) {int n = int(a.size()), m = int(b.size());if (!n || !m) return {};int z = (int)internal::bit_ceil((unsigned int)(n + m - 1));assert((mint::mod() - 1) % z == 0);if (std::min(n, m) <= 60) return convolution_naive(a, b);return internal::convolution_fft(a, b);}template <unsigned int mod = 998244353,class T,std::enable_if_t<internal::is_integral<T>::value>* = nullptr>std::vector<T> convolution(const std::vector<T>& a, const std::vector<T>& b) {int n = int(a.size()), m = int(b.size());if (!n || !m) return {};using mint = static_modint<mod>;int z = (int)internal::bit_ceil((unsigned int)(n + m - 1));assert((mint::mod() - 1) % z == 0);std::vector<mint> a2(n), b2(m);for (int i = 0; i < n; i++) {a2[i] = mint(a[i]);}for (int i = 0; i < m; i++) {b2[i] = mint(b[i]);}auto c2 = convolution(std::move(a2), std::move(b2));std::vector<T> c(n + m - 1);for (int i = 0; i < n + m - 1; i++) {c[i] = c2[i].val();}return c;}std::vector<long long> convolution_ll(const std::vector<long long>& a,const std::vector<long long>& b) {int n = int(a.size()), m = int(b.size());if (!n || !m) return {};static constexpr unsigned long long MOD1 = 754974721; // 2^24static constexpr unsigned long long MOD2 = 167772161; // 2^25static constexpr unsigned long long MOD3 = 469762049; // 2^26static constexpr unsigned long long M2M3 = MOD2 * MOD3;static constexpr unsigned long long M1M3 = MOD1 * MOD3;static constexpr unsigned long long M1M2 = MOD1 * MOD2;static constexpr unsigned long long M1M2M3 = MOD1 * MOD2 * MOD3;static constexpr unsigned long long i1 =internal::inv_gcd(MOD2 * MOD3, MOD1).second;static constexpr unsigned long long i2 =internal::inv_gcd(MOD1 * MOD3, MOD2).second;static constexpr unsigned long long i3 =internal::inv_gcd(MOD1 * MOD2, MOD3).second;static constexpr int MAX_AB_BIT = 24;static_assert(MOD1 % (1ull << MAX_AB_BIT) == 1, "MOD1 isn't enough to support an array length of 2^24.");static_assert(MOD2 % (1ull << MAX_AB_BIT) == 1, "MOD2 isn't enough to support an array length of 2^24.");static_assert(MOD3 % (1ull << MAX_AB_BIT) == 1, "MOD3 isn't enough to support an array length of 2^24.");assert(n + m - 1 <= (1 << MAX_AB_BIT));auto c1 = convolution<MOD1>(a, b);auto c2 = convolution<MOD2>(a, b);auto c3 = convolution<MOD3>(a, b);std::vector<long long> c(n + m - 1);for (int i = 0; i < n + m - 1; i++) {unsigned long long x = 0;x += (c1[i] * i1) % MOD1 * M2M3;x += (c2[i] * i2) % MOD2 * M1M3;x += (c3[i] * i3) % MOD3 * M1M2;long long diff =c1[i] - internal::safe_mod((long long)(x), (long long)(MOD1));if (diff < 0) diff += MOD1;static constexpr unsigned long long offset[5] = {0, 0, M1M2M3, 2 * M1M2M3, 3 * M1M2M3};x -= offset[diff % 5];c[i] = x;}return c;}} // namespace atcoder#line 2 "lib/base/base.hpp"#include<bits/stdc++.h>using namespace std;#define rep(i,n) for(int (i)=0;(i)<(n);++(i))#define rep3(i,m,n) for(int (i)=(m);(i)<(n);++(i))#define endl '\n'#define all(v) (v).begin(),(v).end()using ll = long long;using vi = vector<int>;using vvi = vector<vi>;using vll = vector<ll>;using vvll = vector<vll>;template <class T>using uset = unordered_set<T>;template <class S, class T>using umap = unordered_map<S, T>;using pii = pair<int, int>;using pll = pair<ll, ll>;template <class T>using gprique = priority_queue<T, vector<T>, greater<T>>;template <class T>using lprique = priority_queue<T, vector<T>, less<T>>;const int mod998 = 998244353;const int mod107 = 1000000007;#line 2 "lib/utility/io.hpp"#define INT(...) \int __VA_ARGS__; \IN(__VA_ARGS__)#define LL(...) \ll __VA_ARGS__; \IN(__VA_ARGS__)#define STR(...) \string __VA_ARGS__; \IN(__VA_ARGS__)#define CHR(...) \char __VA_ARGS__; \IN(__VA_ARGS__)#define DBL(...) \long double __VA_ARGS__; \IN(__VA_ARGS__)#define VEC(type, name, size) \vector<type> name(size); \read(name)#define VV(type, name, h, w) \vector<vector<type>> name(h, vector<type>(w)); \read(name)void read(int &a) { cin >> a; }void read(long long &a) { cin >> a; }void read(char &a) { cin >> a; }void read(double &a) { cin >> a; }void read(long double &a) { cin >> a; }void read(string &a) { cin >> a; }template <class T, class S> void read(pair<T, S> &p) { read(p.first), read(p.second); }template <class T> void read(vector<T> &a) {for(auto &i : a) read(i);}template <class T> void read(T &a) { cin >> a; }void IN() {}template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {read(head);IN(tail...);}template <typename T, typename U>ostream& operator<<(ostream& os, const pair<T, U>& A) {os << A.first << " " << A.second;return os;}template <typename T>ostream& operator<<(ostream& os, const vector<T>& A) {for (size_t i = 0; i < A.size(); i++) {if(i) os << " ";os << A[i];}return os;}template <typename T, typename U>ostream& operator<<(ostream& os, const map<T, U>& A) {int count = 0;os << "{";for(auto [t, u] : A){if(count) os << ", ";os << t << ": " << u;count++;}os << "}";return os;}template <typename T>ostream& operator<<(ostream& os, const set<T>& A) {for(auto it = A.begin(); it != A.end(); ++it){if (it != A.begin()) os << " ";os << (*it);}return os;}template <typename T>ostream& operator<<(ostream& os, const multiset<T>& A) {size_t count = 0;T prev;os << "{";bool is_null = true, is_first = true;for(auto it = A.begin(); it != A.end(); ++it){if(it == A.begin()) {is_null = false;prev = (*it);count = 1;}if (prev != (*it)){if(!is_first) os << ", ";is_first = false;os << prev << ": " << count;prev = (*it);count = 1;} else {++count;}}if(!is_null){if(!is_first) os << ", ";is_first = false;os << prev << ": " << count;}os << "}";return os;}void print() {cout << "\n";cout.flush();}template <class Head, class... Tail>void print(Head&& head, Tail&&... tail) {cout << head;if (sizeof...(Tail)) cout << " ";print(forward<Tail>(tail)...);}void YES(bool t = 1) { print(t ? "YES" : "NO"); }void NO(bool t = 1) { YES(!t); }void Yes(bool t = 1) { print(t ? "Yes" : "No"); }void No(bool t = 1) { Yes(!t); }void yes(bool t = 1) { print(t ? "yes" : "no"); }void no(bool t = 1) { yes(!t); }#line 5 "main.cpp"int main(){cin.tie(nullptr);ios::sync_with_stdio(false);int n,m,k;cin >> n >> m >> k;string s,t;cin >> s >> t;string new_s, new_t;vll ul_s(n), ul_t(m);rep(i,n){new_s.push_back(tolower(s[i]));if (new_s[i] == s[i]) ul_s[i] = 0;else ul_s[i] = 1;}rep(i,m){new_t.push_back(tolower(t[i]));if (new_t[i] == t[i]) ul_t[i] = 0;else ul_t[i] = 1;}reverse(all(ul_t));string u = new_s+new_t;vi sa = atcoder::suffix_array(u);vi lcp = atcoder::lcp_array(u, sa);// print(sa);// print(lcp);// print(ul_s);// print(ul_t);vll s_and_t = atcoder::convolution_ll(ul_s, ul_t);// print(s_and_t);int tindex;rep(i,n+m){if (sa[i] == n) {tindex = i;break;}}int now = tindex;int tlsum = 0;rep(i,m) tlsum += ul_t[i];vi ul_scum(n+1,0);rep(i,n) ul_scum[i+1] = ul_scum[i] + ul_s[i];int ans = 0;while(now < n+m-1 && lcp[now]>=m){now++;int sstart = sa[now];if (sstart + m > n) continue;int and_num = s_and_t[sstart+m-1];int l_num = tlsum + ul_scum[sstart+m] - ul_scum[sstart];if (l_num - 2*and_num >= 1 && l_num - 2*and_num <= k) ans++;}print(ans);}