結果

問題 No.2626 Similar But Different Name
ユーザー miscalc
提出日時 2024-02-10 01:49:50
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 203 ms / 3,000 ms
コード長 3,602 bytes
コンパイル時間 4,615 ms
コンパイル使用メモリ 261,576 KB
最終ジャッジ日時 2025-02-19 04:26:11
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
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;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) A = -A, B = -B; return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) A = -A, B = -B; return divfloor(A + B - 1, B);}
ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} 
    return res;}
ll mul_limited(ll A, ll B, ll M = INF) { return B == 0 ? 0 : A > M / B ? M : A * B; }
ll pow_limited(ll A, ll B, ll M = INF) { if (A == 0 || A == 1) {return A;} ll res = 1; for (int i = 0; i < B; i++) {if (res > M / A) return M; res *= 
    A;} return res;}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
//*
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
template <class T, internal::is_static_modint_t<T> * = nullptr>
istream &operator>>(istream &is, T &a) { ll v; is >> v; a = v; return is; }
template <class T, internal::is_dynamic_modint_t<T> * = nullptr>
istream &operator>>(istream &is, T &a) { ll v; is >> v; a = v; return is; }
template <class T, internal::is_static_modint_t<T> * = nullptr>
ostream &operator<<(ostream &os, const T &a) { os << a.val(); return os; }
template <class T, internal::is_dynamic_modint_t<T> * = nullptr>
ostream &operator<<(ostream &os, const T &a) { os << a.val(); return os; }
//*/
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " "); cout << 
    '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}
vector<bool> sub1(ll K, string S, string T)
{
  ll N = S.size(), M = T.size();
  for (auto &c : S) if ('A' <= c && c <= 'Z') c = c - 'A' + 'a';
  for (auto &c : T) if ('A' <= c && c <= 'Z') c = c - 'A' + 'a';
  auto Z = z_algorithm(T + S);
  vector<bool> res(N);
  for (ll i = 0; i < N; i++)
  {
    res.at(i) = Z.at(M + i) >= M;
  }
  return res;
}
vector<bool> sub2(ll K, string S, string T)
{
  ll N = S.size(), M = T.size();
  vector<ll> A(N), B(M), C(N), D(M);
  for (ll i = 0; i < N; i++)
  {
    A.at(i) = ('A' <= S.at(i) && S.at(i) <= 'Z' ? 1 : 0);
    C.at(i) = 1 - A.at(i);
  }
  for (ll i = 0; i < M; i++)
  {
    B.at(i) = ('A' <= T.at(i) && T.at(i) <= 'Z' ? 1 : 0);
    D.at(i) = 1 - B.at(i);
  }
  reverse(B.begin(), B.end());
  reverse(D.begin(), D.end());
  auto E = convolution(A, D), F = convolution(B, C);
  vector<bool> res(N);
  for (ll i = 0; i < N; i++)
  {
    ll val = E.at(M - 1 + i) + F.at(M - 1 + i);
    res.at(i) = 1 <= val && val <= K;
  }
  return res;
}
int main()
{
  ll N, M, K;
  string S, T;
  cin >> N >> M >> K >> S >> T;
  auto A = sub1(K, S, T), B = sub2(K, S, T);
  ll ans = 0;
  for (ll i = 0; i < N; i++)
  {
    if (A.at(i) && B.at(i))
      ans++;
  }
  cout << ans << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0