#690183 (C++17) No.1695 Mirror Mirror

提出ソース

結果

問題	No.1695 Mirror Mirror
ユーザー	stoq
提出日時	2021-08-15 14:19:51
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	60 ms / 2,000 ms
コード長	5,989 bytes
コンパイル時間	4,971 ms
コンパイル使用メモリ	280,272 KB
実行使用メモリ	26,732 KB
最終ジャッジ日時	2024-06-09 11:15:17
合計ジャッジ時間	9,302 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	17 ms 9,216 KB
testcase_01	AC	17 ms 9,088 KB
testcase_02	AC	16 ms 9,088 KB
testcase_03	AC	16 ms 9,088 KB
testcase_04	AC	17 ms 9,088 KB
testcase_05	AC	18 ms 9,088 KB
testcase_06	AC	18 ms 9,088 KB
testcase_07	AC	18 ms 9,088 KB
testcase_08	AC	16 ms 9,216 KB
testcase_09	AC	17 ms 9,088 KB
testcase_10	AC	18 ms 9,088 KB
testcase_11	AC	18 ms 9,088 KB
testcase_12	AC	17 ms 9,088 KB
testcase_13	AC	16 ms 9,216 KB
testcase_14	AC	17 ms 9,088 KB
testcase_15	AC	17 ms 9,088 KB
testcase_16	AC	17 ms 8,960 KB
testcase_17	AC	17 ms 9,216 KB
testcase_18	AC	17 ms 9,088 KB
testcase_19	AC	18 ms 9,216 KB
testcase_20	AC	18 ms 9,088 KB
testcase_21	AC	60 ms 26,280 KB
testcase_22	AC	57 ms 26,008 KB
testcase_23	AC	57 ms 25,480 KB
testcase_24	AC	57 ms 25,484 KB
testcase_25	AC	42 ms 21,736 KB
testcase_26	AC	18 ms 9,088 KB
testcase_27	AC	17 ms 9,088 KB
testcase_28	AC	19 ms 10,180 KB
testcase_29	AC	18 ms 9,088 KB
testcase_30	AC	41 ms 19,944 KB
testcase_31	AC	52 ms 24,436 KB
testcase_32	AC	25 ms 12,924 KB
testcase_33	AC	59 ms 25,296 KB
testcase_34	AC	35 ms 16,220 KB
testcase_35	AC	51 ms 22,888 KB
testcase_36	AC	60 ms 25,696 KB
testcase_37	AC	32 ms 15,144 KB
testcase_38	AC	49 ms 22,948 KB
testcase_39	AC	30 ms 14,324 KB
testcase_40	AC	56 ms 24,320 KB
testcase_41	AC	58 ms 25,956 KB
testcase_42	AC	48 ms 25,940 KB
testcase_43	AC	36 ms 19,616 KB
testcase_44	AC	41 ms 22,060 KB
testcase_45	AC	37 ms 19,468 KB
testcase_46	AC	43 ms 21,332 KB
testcase_47	AC	44 ms 20,780 KB
testcase_48	AC	54 ms 25,128 KB
testcase_49	AC	57 ms 25,856 KB
testcase_50	AC	19 ms 10,384 KB
testcase_51	AC	17 ms 10,768 KB
testcase_52	AC	18 ms 9,972 KB
testcase_53	AC	19 ms 9,984 KB
testcase_54	AC	17 ms 10,004 KB
testcase_55	AC	37 ms 19,060 KB
testcase_56	AC	39 ms 21,660 KB
testcase_57	AC	38 ms 19,688 KB
testcase_58	AC	45 ms 23,504 KB
testcase_59	AC	39 ms 21,788 KB
testcase_60	AC	36 ms 19,624 KB
testcase_61	AC	27 ms 15,600 KB
testcase_62	AC	47 ms 26,376 KB
testcase_63	AC	49 ms 26,732 KB
testcase_64	AC	16 ms 9,088 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#define MOD_TYPE 1

#pragma region Macros

#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif

#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

#if MOD_TYPE == 1
constexpr ll MOD = ll(1e9 + 7);
#else
#if MOD_TYPE == 2
constexpr ll MOD = 998244353;
#else
constexpr ll MOD = 1000003;
#endif
#endif

using mint = static_modint<MOD>;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

struct io_init {
  io_init() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; }
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
template <typename T>
vector<T> compress(vector<T> &v) {
  vector<T> val = v;
  sort(all(val)), val.erase(unique(all(val)), val.end());
  for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();
  return val;
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {
  os << p.first << " " << p.second;
  return os;
}
ostream &operator<<(ostream &os, mint m) {
  os << m.val();
  return os;
}

random_device seed_gen;
mt19937_64 engine(seed_gen());

struct BiCoef {
  vector<mint> fact_, inv_, finv_;
  BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
    fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
    for (int i = 2; i < n; i++) {
      fact_[i] = fact_[i - 1] * i;
      inv_[i] = -inv_[MOD % i] * (MOD / i);
      finv_[i] = finv_[i - 1] * inv_[i];
    }
  }
  mint C(ll n, ll k) const noexcept {
    if (n < k || n < 0 || k < 0) return 0;
    return fact_[n] * finv_[k] * finv_[n - k];
  }
  mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }
  mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }
  mint Ch1(ll n, ll k) const noexcept {
    if (n < 0 || k < 0) return 0;
    mint res = 0;
    for (int i = 0; i < n; i++)
      res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);
    return res;
  }
  mint fact(ll n) const noexcept {
    if (n < 0) return 0;
    return fact_[n];
  }
  mint inv(ll n) const noexcept {
    if (n < 0) return 0;
    return inv_[n];
  }
  mint finv(ll n) const noexcept {
    if (n < 0) return 0;
    return finv_[n];
  }
};

BiCoef bc(500010);

#pragma endregion

// 01BFS
struct BFS {
  vector<int> d;
  vector<vector<pair<int, int>>> E;
  BFS(int V) : d(V, INF), E(V) {}

  void add_edge(int u, int v, bool c, bool directed = true) {
    E[u].push_back({v, c});
    if (!directed) E[v].push_back({u, c});
  }

  void calc(int s) {
    d[s] = 0;
    deque<int> que;
    que.push_front(s);
    while (!que.empty()) {
      int u = que.front();
      que.pop_front();
      for (auto [v, c] : E[u]) {
        if (d[v] <= d[u] + c) continue;
        d[v] = d[u] + c;
        if (!c)
          que.push_front(v);
        else
          que.push_back(v);
      }
    }
  }
};

// 偶回文半径
// res[i] : i と i+1 の間を中心とする回文の長さの Max/2
vector<int> manachar_even(string &s_) {
  string s;
  s.push_back(s_[0]);
  REP(i, 1, s_.length()) {
    s.push_back('$');
    s.push_back(s_[i]);
  }
  vector<int> mch(s.length()), res;
  int i = 0, j = 0;
  while (i < s.size()) {
    while (i - j >= 0 && i + j < s.size() && s[i - j] == s[i + j]) ++j;
    mch[i] = j;
    int k = 1;
    while (i - k >= 0 && k + mch[i - k] < j) mch[i + k] = mch[i - k], ++k;
    i += k, j -= k;
  }
  for (int i = 1; i < mch.size(); i += 2) res.push_back(mch[i] / 2);
  return res;
}

void solve() {
  int n, m;
  string s, t;
  cin >> n >> m >> s >> t;
  string u = t;
  reverse(all(u));
  if (t.length() % 2 == 1 or t != u) {
    cout << -1 << "\n";
    return;
  }
  t = t.substr(0, t.length() / 2);
  m /= 2;

  BFS bfs(m + 1);
  const int S = m;

  repi(i, min(m, n)) {
    if (s[i] != t[i]) break;
    bfs.add_edge(S, i, 1);
  }
  repi(i, min(m, n)) {
    if (s[n - i - 1] != t[i]) break;
    bfs.add_edge(S, i, 1);
  }

  auto r = manachar_even(t);

  rep(i, m - 1) {
    bfs.add_edge(i + 1, i, 0);
    if (r[i] > 0) bfs.add_edge(i, i + r[i], 1);
  }
  bfs.calc(S);
  int ans = bfs.d[m - 1];
  cout << (ans == INF ? -1 : ans) << "\n";
}

int main() { solve(); }

yukicoder

結果

テストケース

ソースコード