= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate internal::barrett dynamic_modint::bt = 998244353;\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate \nusing is_static_modint = std::is_base_of;\n\ntemplate \nusing is_static_modint_t = std::enable_if_t::value>;\n\ntemplate struct is_dynamic_modint : public std::false_type {};\ntemplate \nstruct is_dynamic_modint> : public std::true_type {};\n\ntemplate \nusing is_dynamic_modint_t = std::enable_if_t::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include \n#include \n#include \n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate * = nullptr>\nvoid butterfly(std::vector& a) {\n static constexpr int g = internal::primitive_root;\n int n = int(a.size());\n int h = internal::ceil_pow2(n);\n\n static bool first = true;\n static mint sum_e[30]; // sum_e[i] = ies[0] * ... * ies[i - 1] * es[i]\n if (first) {\n first = false;\n mint es[30], ies[30]; // es[i]^(2^(2+i)) == 1\n int cnt2 = bsf(mint::mod() - 1);\n mint e = mint(g).pow((mint::mod() - 1) >> cnt2), ie = e.inv();\n for (int i = cnt2; i >= 2; i--) {\n // e^(2^i) == 1\n es[i - 2] = e;\n ies[i - 2] = ie;\n e *= e;\n ie *= ie;\n }\n mint now = 1;\n for (int i = 0; i <= cnt2 - 2; i++) {\n sum_e[i] = es[i] * now;\n now *= ies[i];\n }\n }\n for (int ph = 1; ph <= h; ph++) {\n int w = 1 << (ph - 1), p = 1 << (h - ph);\n mint now = 1;\n for (int s = 0; s < w; s++) {\n int offset = s << (h - ph + 1);\n for (int i = 0; i < p; i++) {\n auto l = a[i + offset];\n auto r = a[i + offset + p] * now;\n a[i + offset] = l + r;\n a[i + offset + p] = l - r;\n }\n now *= sum_e[bsf(~(unsigned int)(s))];\n }\n }\n}\n\ntemplate * = nullptr>\nvoid butterfly_inv(std::vector& a) {\n static constexpr int g = internal::primitive_root;\n int n = int(a.size());\n int h = internal::ceil_pow2(n);\n\n static bool first = true;\n static mint sum_ie[30]; // sum_ie[i] = es[0] * ... * es[i - 1] * ies[i]\n if (first) {\n first = false;\n mint es[30], ies[30]; // es[i]^(2^(2+i)) == 1\n int cnt2 = bsf(mint::mod() - 1);\n mint e = mint(g).pow((mint::mod() - 1) >> cnt2), ie = e.inv();\n for (int i = cnt2; i >= 2; i--) {\n // e^(2^i) == 1\n es[i - 2] = e;\n ies[i - 2] = ie;\n e *= e;\n ie *= ie;\n }\n mint now = 1;\n for (int i = 0; i <= cnt2 - 2; i++) {\n sum_ie[i] = ies[i] * now;\n now *= es[i];\n }\n }\n\n for (int ph = h; ph >= 1; ph--) {\n int w = 1 << (ph - 1), p = 1 << (h - ph);\n mint inow = 1;\n for (int s = 0; s < w; s++) {\n int offset = s << (h - ph + 1);\n for (int i = 0; i < p; i++) {\n auto l = a[i + offset];\n auto r = a[i + offset + p];\n a[i + offset] = l + r;\n a[i + offset + p] =\n (unsigned long long)(mint::mod() + l.val() - r.val()) *\n inow.val();\n }\n inow *= sum_ie[bsf(~(unsigned int)(s))];\n }\n }\n}\n\n} // namespace internal\n\ntemplate * = nullptr>\nstd::vector convolution(std::vector a, std::vector b) {\n int n = int(a.size()), m = int(b.size());\n if (!n || !m) return {};\n if (std::min(n, m) <= 60) {\n if (n < m) {\n std::swap(n, m);\n std::swap(a, b);\n }\n std::vector ans(n + m - 1);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n ans[i + j] += a[i] * b[j];\n }\n }\n return ans;\n }\n int z = 1 << internal::ceil_pow2(n + m - 1);\n a.resize(z);\n internal::butterfly(a);\n b.resize(z);\n internal::butterfly(b);\n for (int i = 0; i < z; i++) {\n a[i] *= b[i];\n }\n internal::butterfly_inv(a);\n a.resize(n + m - 1);\n mint iz = mint(z).inv();\n for (int i = 0; i < n + m - 1; i++) a[i] *= iz;\n return a;\n}\n\ntemplate ::value>* = nullptr>\nstd::vector convolution(const std::vector& a, const std::vector& b) {\n int n = int(a.size()), m = int(b.size());\n if (!n || !m) return {};\n\n using mint = static_modint;\n std::vector a2(n), b2(m);\n for (int i = 0; i < n; i++) {\n a2[i] = mint(a[i]);\n }\n for (int i = 0; i < m; i++) {\n b2[i] = mint(b[i]);\n }\n auto c2 = convolution(move(a2), move(b2));\n std::vector c(n + m - 1);\n for (int i = 0; i < n + m - 1; i++) {\n c[i] = c2[i].val();\n }\n return c;\n}\n\nstd::vector convolution_ll(const std::vector& a,\n const std::vector& b) {\n int n = int(a.size()), m = int(b.size());\n if (!n || !m) return {};\n\n static constexpr unsigned long long MOD1 = 754974721; // 2^24\n static constexpr unsigned long long MOD2 = 167772161; // 2^25\n static constexpr unsigned long long MOD3 = 469762049; // 2^26\n static constexpr unsigned long long M2M3 = MOD2 * MOD3;\n static constexpr unsigned long long M1M3 = MOD1 * MOD3;\n static constexpr unsigned long long M1M2 = MOD1 * MOD2;\n static constexpr unsigned long long M1M2M3 = MOD1 * MOD2 * MOD3;\n\n static constexpr unsigned long long i1 =\n internal::inv_gcd(MOD2 * MOD3, MOD1).second;\n static constexpr unsigned long long i2 =\n internal::inv_gcd(MOD1 * MOD3, MOD2).second;\n static constexpr unsigned long long i3 =\n internal::inv_gcd(MOD1 * MOD2, MOD3).second;\n\n auto c1 = convolution(a, b);\n auto c2 = convolution(a, b);\n auto c3 = convolution(a, b);\n\n std::vector c(n + m - 1);\n for (int i = 0; i < n + m - 1; i++) {\n unsigned long long x = 0;\n x += (c1[i] * i1) % MOD1 * M2M3;\n x += (c2[i] * i2) % MOD2 * M1M3;\n x += (c3[i] * i3) % MOD3 * M1M2;\n // B = 2^63, -B <= x, r(real value) < B\n // (x, x - M, x - 2M, or x - 3M) = r (mod 2B)\n // r = c1[i] (mod MOD1)\n // focus on MOD1\n // r = x, x - M', x - 2M', x - 3M' (M' = M % 2^64) (mod 2B)\n // r = x,\n // x - M' + (0 or 2B),\n // x - 2M' + (0, 2B or 4B),\n // x - 3M' + (0, 2B, 4B or 6B) (without mod!)\n // (r - x) = 0, (0)\n // - M' + (0 or 2B), (1)\n // -2M' + (0 or 2B or 4B), (2)\n // -3M' + (0 or 2B or 4B or 6B) (3) (mod MOD1)\n // we checked that\n // ((1) mod MOD1) mod 5 = 2\n // ((2) mod MOD1) mod 5 = 3\n // ((3) mod MOD1) mod 5 = 4\n long long diff =\n c1[i] - internal::safe_mod((long long)(x), (long long)(MOD1));\n if (diff < 0) diff += MOD1;\n static constexpr unsigned long long offset[5] = {\n 0, 0, M1M2M3, 2 * M1M2M3, 3 * M1M2M3};\n x -= offset[diff % 5];\n c[i] = x;\n }\n\n return c;\n}\n\n} // namespace atcoder\n\nusing namespace std;\nusing namespace atcoder;\nint AW,AH,BW,BH;\nmain()\n{\n\tcin>>AW>>AH>>BW>>BH;\n\tvectora1(AW*AH),a2(AW*AH),a3(AW*AH);\n\tfor(int i=0;i>A;\n\t\tfor(int j=0;jb1(len),b2(len),b3(len);\n\tfor(int i=0;i>B;\n\t\tfor(int j=0;jc1=convolution_ll(a3,b1);\n\tvectorc2=convolution_ll(a2,b2);\n\tvectorc3=convolution_ll(a1,b3);\n\tint ans=0;\n\tfor(int i=0;i+BH<=AH;i++)\n\t{\n\t\tfor(int j=0;j<=AW-BW;j++)\n\t\t{\n\t\t\tlong t=c1[len-1+i*AW+j]-2*c2[len-1+i*AW+j]+c3[len-1+i*AW+j];\n\t\t\tif(t==0)ans++;\n\t\t}\n\t}\n\tcout<\n#include \n#include \n#include \n#include \n#pragma GCC target(\"avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\nusing namespace std;\nint transform(char ch) {\n\tif ('0' <= ch && ch <= '9') return ch - '0' + 1;\n\tif ('A' <= ch && ch <= 'Z') return ch - 'A' + 11;\n\tif ('a' <= ch && ch <= 'z') return ch - 'a' + 37;\n\treturn 0;\n}\nbitset<640> bit1[128], bit2[128], bit3[128], bit4[128];\nint main() {\n\tcin.tie(0);\n\tios_base::sync_with_stdio(false);\n\tint AH, AW, BH, BW;\n\tcin >> AW >> AH >> BW >> BH;\n\tvector > A(AH, vector(AW)), B(BH, vector(BW));\n\tfor (int i = 0; i < AH; ++i) {\n\t\tstring str;\n\t\tcin >> str;\n\t\tfor (int j = 0; j < AW; ++j) {\n\t\t\tA[i][j] = transform(str[j]);\n\t\t}\n\t}\n\tfor (int i = 0; i < BH; ++i) {\n\t\tstring str;\n\t\tcin >> str;\n\t\tfor (int j = 0; j < BW; ++j) {\n\t\t\tB[i][j] = transform(str[j]);\n\t\t}\n\t}\n\tfor (int i = 0; i < BH; ++i) {\n\t\tfor (int j = 0; j < BW; ++j) {\n\t\t\tfor (int k = 0; k < 6; ++k) {\n\t\t\t\tbit3[i][j * 6 + k] = ((B[i][j] >> k) & 1);\n\t\t\t\tbit4[i][j * 6 + k] = (B[i][j] != 0 ? 1 : 0);\n\t\t\t}\n\t\t}\n\t}\n\tint ans = 0;\n\tfor (int i = 0; i <= AH - BH; ++i) {\n\t\tfor (int j = 0; j < BH; ++j) {\n\t\t\tfor (int k = 0; k < BW; ++k) {\n\t\t\t\tfor (int l = 0; l < 6; ++l) {\n\t\t\t\t\tbit1[j][k * 6 + l] = ((A[i + j][k] >> l) & 1);\n\t\t\t\t\tbit2[j][k * 6 + l] = (A[i + j][k] != 0 ? 1 : 0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int j = 0; j <= AW - BW; ++j) {\n\t\t\tbool ok = true;\n\t\t\tfor (int k = 0; k < BH; ++k) {\n\t\t\t\tif (((bit1[k] ^ bit3[k]) & (bit2[k] & bit4[k])) != 0) {\n\t\t\t\t\tok = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (ok) {\n\t\t\t\t++ans;\n\t\t\t}\n\t\t\tif (j != AW - BW) {\n\t\t\t\tfor (int k = 0; k < BH; ++k) {\n\t\t\t\t\tbit1[k] >>= 6;\n\t\t\t\t\tbit2[k] >>= 6;\n\t\t\t\t\tfor (int l = 0; l < 6; ++l) {\n\t\t\t\t\t\tbit1[k][BW * 6 - 6 + l] = ((A[i + k][j + BW] >> l) & 1);\n\t\t\t\t\t\tbit2[k][BW * 6 - 6 + l] = (A[i + k][j + BW] != 0 ? 1 : 0);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":1380,"memory_kb":5440,"score_of_the_acc":-0.8709,"final_rank":15},{"submission_id":"aoj_0378_4978995","code_snippet":"#include \nusing namespace std;\nint num(char c){\n if ('A' <= c && c <= 'Z'){\n return c - 'A';\n } else if ('a' <= c && c <= 'z'){\n return c - 'a' + 26;\n } else if ('0' <= c && c <= '9'){\n return c - '0' + 52;\n } else {\n return 62;\n }\n}\nint main(){\n int AW, AH, BW, BH;\n cin >> AW >> AH >> BW >> BH;\n vector> A(AH + 200, vector(AW + 200, '#'));\n for (int i = 100; i < AH + 100; i++){\n for (int j = 100; j < AW + 100; j++){\n cin >> A[i][j];\n }\n }\n vector> B(BH, vector(BW));\n for (int i = 0; i < BH; i++){\n for (int j = 0; j < BW; j++){\n cin >> B[i][j];\n }\n }\n vector> id(AH + 200, vector(AW + 200));\n for (int i = 0; i < AH + 200; i++){\n for (int j = 0; j < AW + 200; j++){\n id[i][j] = i * (AW + 200) + j;\n }\n }\n bitset<1000000> X(0);\n for (int i = 0; i < AH + 200; i++){\n for (int j = 0; j < AW + 200; j++){\n if (A[i][j] != '?'){\n X.set(id[i][j]);\n }\n }\n }\n vector> posA(63);\n for (int i = 100; i < AH + 100; i++){\n for (int j = 100; j < AW + 100; j++){\n if (A[i][j] != '?'){\n posA[num(A[i][j])].push_back(id[i][j]);\n }\n }\n }\n vector> posB(63);\n for (int i = 0; i < BH; i++){\n for (int j = 0; j < BW; j++){\n if (B[i][j] != '?'){\n posB[num(B[i][j])].push_back(id[i][j]);\n }\n }\n }\n bitset<1000000> ans(0);\n for (int i = 0; i < 1000000; i++){\n ans.set(i);\n }\n for (int i = 100; i < AH + 100; i++){\n for (int j = 100; j < AW + 100; j++){\n if (A[i][j] != '#' && A[i + BH - 1][j + BW - 1] != '#'){\n ans.reset(id[i][j]);\n }\n }\n }\n for (int i = 0; i < 62; i++){\n for (int j : posA[i]){\n X.reset(j);\n }\n for (int j : posB[i]){\n ans |= X >> j;\n }\n for (int j : posA[i]){\n X.set(j);\n }\n }\n int cnt = 0;\n for (int i = 100; i < AH + 100; i++){\n for (int j = 100; j < AW + 100; j++){\n if (ans[id[i][j]] == 0){\n cnt++;\n }\n }\n }\n cout << cnt << endl;\n}","accuracy":1,"time_ms":340,"memory_kb":10420,"score_of_the_acc":-0.1555,"final_rank":7},{"submission_id":"aoj_0378_4978984","code_snippet":"#include \nusing namespace std;\nint num(char c){\n if ('A' <= c && c <= 'Z'){\n return c - 'A';\n } else if ('a' <= c && c <= 'z'){\n return c - 'a' + 26;\n } else if ('0' <= c && c <= '9'){\n return c - '0' + 52;\n } else {\n return 62;\n }\n}\nint main(){\n int AW, AH, BW, BH;\n cin >> AW >> AH >> BW >> BH;\n vector> A(AH + 200, vector(AW + 200, '#'));\n for (int i = 100; i < AH + 100; i++){\n for (int j = 100; j < AW + 100; j++){\n cin >> A[i][j];\n }\n }\n vector> B(BH, vector(BW));\n for (int i = 0; i < BH; i++){\n for (int j = 0; j < BW; j++){\n cin >> B[i][j];\n }\n }\n vector> id(AH + 200, vector(AW + 200));\n for (int i = 0; i < AH + 200; i++){\n for (int j = 0; j < AW + 200; j++){\n id[i][j] = i * (AW + 200) + j;\n }\n }\n bitset<1000000> X(0);\n for (int i = 0; i < AH + 200; i++){\n for (int j = 0; j < AW + 200; j++){\n if (A[i][j] != '?'){\n X.set(id[i][j]);\n }\n }\n }\n vector> posA(63);\n for (int i = 100; i < AH + 100; i++){\n for (int j = 100; j < AW + 100; j++){\n if (A[i][j] != '?'){\n posA[num(A[i][j])].push_back(id[i][j]);\n }\n }\n }\n vector> posB(63);\n for (int i = 0; i < BH; i++){\n for (int j = 0; j < BW; j++){\n if (B[i][j] != '?'){\n posB[num(B[i][j])].push_back(id[i][j]);\n }\n }\n }\n bitset<1000000> ans;\n for (int i = 0; i < 62; i++){\n for (int j : posA[i]){\n X.reset(j);\n }\n for (int j : posB[i]){\n ans |= X >> j;\n }\n for (int j : posA[i]){\n X.set(j);\n }\n }\n int cnt = 0;\n for (int i = 100; i < AH + 100; i++){\n for (int j = 100; j < AW + 100; j++){\n if (ans[id[i][j]] == 0){\n cnt++;\n }\n }\n }\n cout << cnt << endl;\n}","accuracy":0.5357142857142857,"time_ms":260,"memory_kb":8956,"score_of_the_acc":-0.0922,"final_rank":19},{"submission_id":"aoj_0378_4899489","code_snippet":"#include \n#include \n\n#ifdef _MSC_VER\n#include \n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param n `0 <= n`\n// @return minimum non-negative `x` s.t. `n <= 2**x`\nint ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nint bsf(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n\n#include \n#include \n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast moduler by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m`\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n // _umul128(z, im, &x);\n x = 0;\n std::abort();\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n for (long long a : {2, 7, 61}) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate constexpr int primitive_root = primitive_root_constexpr(m);\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#include \n#include \n#include \n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate \nusing is_signed_int128 =\n typename std::conditional::value ||\n std::is_same::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate \nusing is_unsigned_int128 =\n typename std::conditional::value ||\n std::is_same::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate \nusing make_unsigned_int128 =\n typename std::conditional::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate \nusing is_integral = typename std::conditional::value ||\n is_signed_int128::value ||\n is_unsigned_int128::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate \nusing is_signed_int = typename std::conditional<(is_integral::value &&\n std::is_signed::value) ||\n is_signed_int128::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate \nusing is_unsigned_int =\n typename std::conditional<(is_integral::value &&\n std::is_unsigned::value) ||\n is_unsigned_int128::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate \nusing to_unsigned = typename std::conditional<\n is_signed_int128::value,\n make_unsigned_int128,\n typename std::conditional::value,\n std::make_unsigned,\n std::common_type>::type>::type;\n\n#else\n\ntemplate using is_integral = typename std::is_integral;\n\ntemplate \nusing is_signed_int =\n typename std::conditional::value && std::is_signed::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate \nusing is_unsigned_int =\n typename std::conditional::value &&\n std::is_unsigned::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate \nusing to_unsigned = typename std::conditional::value,\n std::make_unsigned,\n std::common_type>::type;\n\n#endif\n\ntemplate \nusing is_signed_int_t = std::enable_if_t::value>;\n\ntemplate \nusing is_unsigned_int_t = std::enable_if_t::value>;\n\ntemplate using to_unsigned_t = typename to_unsigned::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include \n#include \n#include \n\n#ifdef _MSC_VER\n#include \n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate using is_modint = std::is_base_of;\ntemplate using is_modint_t = std::enable_if_t::value>;\n\n} // namespace internal\n\ntemplate * = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template * = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template * = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime;\n};\n\ntemplate struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template * = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template * = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate internal::barrett dynamic_modint::bt = 998244353;\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate \nusing is_static_modint = std::is_base_of;\n\ntemplate \nusing is_static_modint_t = std::enable_if_t::value>;\n\ntemplate struct is_dynamic_modint : public std::false_type {};\ntemplate \nstruct is_dynamic_modint> : public std::true_type {};\n\ntemplate \nusing is_dynamic_modint_t = std::enable_if_t::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include \n#include \n#include \n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate * = nullptr>\nvoid butterfly(std::vector& a) {\n static constexpr int g = internal::primitive_root;\n int n = int(a.size());\n int h = internal::ceil_pow2(n);\n\n static bool first = true;\n static mint sum_e[30]; // sum_e[i] = ies[0] * ... * ies[i - 1] * es[i]\n if (first) {\n first = false;\n mint es[30], ies[30]; // es[i]^(2^(2+i)) == 1\n int cnt2 = bsf(mint::mod() - 1);\n mint e = mint(g).pow((mint::mod() - 1) >> cnt2), ie = e.inv();\n for (int i = cnt2; i >= 2; i--) {\n // e^(2^i) == 1\n es[i - 2] = e;\n ies[i - 2] = ie;\n e *= e;\n ie *= ie;\n }\n mint now = 1;\n for (int i = 0; i < cnt2 - 2; i++) {\n sum_e[i] = es[i] * now;\n now *= ies[i];\n }\n }\n for (int ph = 1; ph <= h; ph++) {\n int w = 1 << (ph - 1), p = 1 << (h - ph);\n mint now = 1;\n for (int s = 0; s < w; s++) {\n int offset = s << (h - ph + 1);\n for (int i = 0; i < p; i++) {\n auto l = a[i + offset];\n auto r = a[i + offset + p] * now;\n a[i + offset] = l + r;\n a[i + offset + p] = l - r;\n }\n now *= sum_e[bsf(~(unsigned int)(s))];\n }\n }\n}\n\ntemplate * = nullptr>\nvoid butterfly_inv(std::vector& a) {\n static constexpr int g = internal::primitive_root;\n int n = int(a.size());\n int h = internal::ceil_pow2(n);\n\n static bool first = true;\n static mint sum_ie[30]; // sum_ie[i] = es[0] * ... * es[i - 1] * ies[i]\n if (first) {\n first = false;\n mint es[30], ies[30]; // es[i]^(2^(2+i)) == 1\n int cnt2 = bsf(mint::mod() - 1);\n mint e = mint(g).pow((mint::mod() - 1) >> cnt2), ie = e.inv();\n for (int i = cnt2; i >= 2; i--) {\n // e^(2^i) == 1\n es[i - 2] = e;\n ies[i - 2] = ie;\n e *= e;\n ie *= ie;\n }\n mint now = 1;\n for (int i = 0; i < cnt2 - 2; i++) {\n sum_ie[i] = ies[i] * now;\n now *= es[i];\n }\n }\n\n for (int ph = h; ph >= 1; ph--) {\n int w = 1 << (ph - 1), p = 1 << (h - ph);\n mint inow = 1;\n for (int s = 0; s < w; s++) {\n int offset = s << (h - ph + 1);\n for (int i = 0; i < p; i++) {\n auto l = a[i + offset];\n auto r = a[i + offset + p];\n a[i + offset] = l + r;\n a[i + offset + p] =\n (unsigned long long)(mint::mod() + l.val() - r.val()) *\n inow.val();\n }\n inow *= sum_ie[bsf(~(unsigned int)(s))];\n }\n }\n}\n\n} // namespace internal\n\ntemplate * = nullptr>\nstd::vector convolution(std::vector a, std::vector b) {\n int n = int(a.size()), m = int(b.size());\n if (!n || !m) return {};\n if (std::min(n, m) <= 60) {\n if (n < m) {\n std::swap(n, m);\n std::swap(a, b);\n }\n std::vector ans(n + m - 1);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n ans[i + j] += a[i] * b[j];\n }\n }\n return ans;\n }\n int z = 1 << internal::ceil_pow2(n + m - 1);\n a.resize(z);\n internal::butterfly(a);\n b.resize(z);\n internal::butterfly(b);\n for (int i = 0; i < z; i++) {\n a[i] *= b[i];\n }\n internal::butterfly_inv(a);\n a.resize(n + m - 1);\n mint iz = mint(z).inv();\n for (int i = 0; i < n + m - 1; i++) a[i] *= iz;\n return a;\n}\n\ntemplate ::value>* = nullptr>\nstd::vector convolution(const std::vector& a, const std::vector& b) {\n int n = int(a.size()), m = int(b.size());\n if (!n || !m) return {};\n\n using mint = static_modint;\n std::vector a2(n), b2(m);\n for (int i = 0; i < n; i++) {\n a2[i] = mint(a[i]);\n }\n for (int i = 0; i < m; i++) {\n b2[i] = mint(b[i]);\n }\n auto c2 = convolution(move(a2), move(b2));\n std::vector c(n + m - 1);\n for (int i = 0; i < n + m - 1; i++) {\n c[i] = c2[i].val();\n }\n return c;\n}\n\nstd::vector convolution_ll(const std::vector& a,\n const std::vector& b) {\n int n = int(a.size()), m = int(b.size());\n if (!n || !m) return {};\n\n static constexpr unsigned long long MOD1 = 754974721; // 2^24\n static constexpr unsigned long long MOD2 = 167772161; // 2^25\n static constexpr unsigned long long MOD3 = 469762049; // 2^26\n static constexpr unsigned long long M2M3 = MOD2 * MOD3;\n static constexpr unsigned long long M1M3 = MOD1 * MOD3;\n static constexpr unsigned long long M1M2 = MOD1 * MOD2;\n static constexpr unsigned long long M1M2M3 = MOD1 * MOD2 * MOD3;\n\n static constexpr unsigned long long i1 =\n internal::inv_gcd(MOD2 * MOD3, MOD1).second;\n static constexpr unsigned long long i2 =\n internal::inv_gcd(MOD1 * MOD3, MOD2).second;\n static constexpr unsigned long long i3 =\n internal::inv_gcd(MOD1 * MOD2, MOD3).second;\n\n auto c1 = convolution(a, b);\n auto c2 = convolution(a, b);\n auto c3 = convolution(a, b);\n\n std::vector c(n + m - 1);\n for (int i = 0; i < n + m - 1; i++) {\n unsigned long long x = 0;\n x += (c1[i] * i1) % MOD1 * M2M3;\n x += (c2[i] * i2) % MOD2 * M1M3;\n x += (c3[i] * i3) % MOD3 * M1M2;\n // B = 2^63, -B <= x, r(real value) < B\n // (x, x - M, x - 2M, or x - 3M) = r (mod 2B)\n // r = c1[i] (mod MOD1)\n // focus on MOD1\n // r = x, x - M', x - 2M', x - 3M' (M' = M % 2^64) (mod 2B)\n // r = x,\n // x - M' + (0 or 2B),\n // x - 2M' + (0, 2B or 4B),\n // x - 3M' + (0, 2B, 4B or 6B) (without mod!)\n // (r - x) = 0, (0)\n // - M' + (0 or 2B), (1)\n // -2M' + (0 or 2B or 4B), (2)\n // -3M' + (0 or 2B or 4B or 6B) (3) (mod MOD1)\n // we checked that\n // ((1) mod MOD1) mod 5 = 2\n // ((2) mod MOD1) mod 5 = 3\n // ((3) mod MOD1) mod 5 = 4\n long long diff =\n c1[i] - internal::safe_mod((long long)(x), (long long)(MOD1));\n if (diff < 0) diff += MOD1;\n static constexpr unsigned long long offset[5] = {\n 0, 0, M1M2M3, 2 * M1M2M3, 3 * M1M2M3};\n x -= offset[diff % 5];\n c[i] = x;\n }\n\n return c;\n}\n\n} // namespace atcoder\n\n\n#include \n#include \n#include \n#include \n\nstd::vector wildcard_pattern_matching(const std::vector &p,\n const std::vector &s) {\n using ll = long long;\n using usize = std::size_t;\n static constexpr int mod = 1811939329;\n using mint = atcoder::static_modint;\n\n const usize n = p.size();\n const usize m = s.size();\n\n assert(1 <= n);\n assert(m <= m);\n assert(n + m - 1 <= (mod - 1 & ~(mod - 1) + 1));\n assert(std::all_of(p.begin(), p.end(), [](int x) { return -1 <= x < mod; }));\n assert(std::all_of(s.begin(), s.end(), [](int x) { return -1 <= x < mod; }));\n {\n const int max = std::max(*std::max_element(p.begin(), p.end()),\n *std::max_element(s.begin(), s.end()));\n assert(ll(max) * max < mod);\n assert(ll(max) * max * p.size() < mod);\n }\n\n std::vector sum(m - n + 1, mint(0));\n\n const auto add = [&](const auto f, const auto g) {\n std::vector x(n), y(m);\n for (usize i = 0; i != n; ++i) {\n x[i] = f(p[n - 1 - i]);\n }\n for (usize i = 0; i != m; ++i) {\n y[i] = g(s[i]);\n }\n const auto z = atcoder::convolution(x, y);\n for (usize i = 0; i != m - n + 1; ++i) {\n sum[i] += z[n - 1 + i];\n }\n };\n\n add([](const int v) { return ll(v != -1) * v * v; },\n [](const int v) { return int(v != -1); });\n add([](const int v) { return -2 * int(v != -1) * v; },\n [](const int v) { return int(v != -1) * v; });\n add([](const int v) { return int(v != -1); },\n [](const int v) { return ll(v != -1) * v * v; });\n\n std::vector res(m - n + 1);\n for (usize i = 0; i != m - n + 1; ++i) {\n res[i] = sum[i].val() == 0;\n }\n\n return res;\n}\n\n#include \n#include \n\nint main() {\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(nullptr);\n\n int AW, AH, BW, BH;\n std::cin >> AW >> AH >> BW >> BH;\n std::vector s(AH * AW), p(AW * (BH - 1) + BW, -1);\n\n const auto convert = [](const char c) -> int {\n if (c == '?') {\n return -1;\n } else if ('0' <= c && c <= '9') {\n return c - '0';\n } else if ('a' <= c && c <= 'z') {\n return c - 'a' + 10;\n } else {\n return c - 'A' + 10 + 26;\n }\n };\n\n for (int i = 0; i != AH; ++i) {\n for (int j = 0; j != AW; ++j) {\n char c;\n std::cin >> c;\n s[AW * i + j] = convert(c);\n }\n }\n\n for (int i = 0; i != BH; ++i) {\n for (int j = 0; j != BW; ++j) {\n char c;\n std::cin >> c;\n p[AW * i + j] = convert(c);\n }\n }\n\n const auto m = wildcard_pattern_matching(p, s);\n int ans = 0;\n for (int i = 0; i + BH <= AH; ++i) {\n for (int j = 0; j + BW <= AW; ++j) {\n if (m[AW * i + j]) {\n ++ans;\n }\n }\n }\n\n std::cout << ans << \"\\n\";\n\n return 0;\n}","accuracy":1,"time_ms":220,"memory_kb":22408,"score_of_the_acc":-0.1237,"final_rank":5},{"submission_id":"aoj_0378_4885390","code_snippet":"#include \n#include \n#include