結果
問題 | No.1695 Mirror Mirror |
ユーザー | stoq |
提出日時 | 2021-08-15 01:53:32 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 185 ms / 2,000 ms |
コード長 | 5,648 bytes |
コンパイル時間 | 6,334 ms |
コンパイル使用メモリ | 273,572 KB |
実行使用メモリ | 18,808 KB |
最終ジャッジ日時 | 2023-08-28 16:04:35 |
合計ジャッジ時間 | 13,677 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 17 ms
8,956 KB |
testcase_01 | AC | 17 ms
8,740 KB |
testcase_02 | AC | 16 ms
8,868 KB |
testcase_03 | AC | 16 ms
8,804 KB |
testcase_04 | AC | 16 ms
8,940 KB |
testcase_05 | AC | 16 ms
8,856 KB |
testcase_06 | AC | 17 ms
8,816 KB |
testcase_07 | AC | 16 ms
8,864 KB |
testcase_08 | AC | 16 ms
8,864 KB |
testcase_09 | AC | 16 ms
8,836 KB |
testcase_10 | AC | 17 ms
8,860 KB |
testcase_11 | AC | 17 ms
8,912 KB |
testcase_12 | AC | 16 ms
8,704 KB |
testcase_13 | AC | 16 ms
8,856 KB |
testcase_14 | AC | 17 ms
8,812 KB |
testcase_15 | AC | 17 ms
8,920 KB |
testcase_16 | AC | 17 ms
8,804 KB |
testcase_17 | AC | 16 ms
8,800 KB |
testcase_18 | AC | 16 ms
8,940 KB |
testcase_19 | AC | 16 ms
8,956 KB |
testcase_20 | AC | 16 ms
9,020 KB |
testcase_21 | AC | 185 ms
18,136 KB |
testcase_22 | AC | 184 ms
18,120 KB |
testcase_23 | AC | 137 ms
18,324 KB |
testcase_24 | AC | 171 ms
18,300 KB |
testcase_25 | AC | 52 ms
16,332 KB |
testcase_26 | AC | 16 ms
8,736 KB |
testcase_27 | AC | 17 ms
8,816 KB |
testcase_28 | AC | 18 ms
10,152 KB |
testcase_29 | AC | 16 ms
8,736 KB |
testcase_30 | AC | 57 ms
16,672 KB |
testcase_31 | AC | 79 ms
18,276 KB |
testcase_32 | AC | 34 ms
11,492 KB |
testcase_33 | AC | 131 ms
18,724 KB |
testcase_34 | AC | 63 ms
13,528 KB |
testcase_35 | AC | 113 ms
17,592 KB |
testcase_36 | AC | 133 ms
18,484 KB |
testcase_37 | AC | 62 ms
13,168 KB |
testcase_38 | AC | 124 ms
17,876 KB |
testcase_39 | AC | 48 ms
12,952 KB |
testcase_40 | AC | 148 ms
17,580 KB |
testcase_41 | AC | 175 ms
18,488 KB |
testcase_42 | AC | 72 ms
18,608 KB |
testcase_43 | AC | 57 ms
16,652 KB |
testcase_44 | AC | 61 ms
17,056 KB |
testcase_45 | AC | 53 ms
16,424 KB |
testcase_46 | AC | 111 ms
17,236 KB |
testcase_47 | AC | 92 ms
17,144 KB |
testcase_48 | AC | 114 ms
18,808 KB |
testcase_49 | AC | 153 ms
18,640 KB |
testcase_50 | AC | 19 ms
10,380 KB |
testcase_51 | AC | 19 ms
10,596 KB |
testcase_52 | AC | 18 ms
9,896 KB |
testcase_53 | AC | 18 ms
9,804 KB |
testcase_54 | AC | 18 ms
9,944 KB |
testcase_55 | AC | 56 ms
16,228 KB |
testcase_56 | AC | 67 ms
16,848 KB |
testcase_57 | AC | 80 ms
16,528 KB |
testcase_58 | AC | 65 ms
18,036 KB |
testcase_59 | AC | 60 ms
17,260 KB |
testcase_60 | AC | 64 ms
16,388 KB |
testcase_61 | AC | 38 ms
13,212 KB |
testcase_62 | AC | 63 ms
18,516 KB |
testcase_63 | AC | 81 ms
18,324 KB |
testcase_64 | AC | 16 ms
8,984 KB |
ソースコード
#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 // 偶回文半径 // 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; } int my_min(int a, int b) { return min(a, b); } int e() { return INF; }; 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; vector<int> v(m, INF); rep(i, min(m, n)) { if (s[i] != t[i]) break; v[i] = 1; } rep(i, min(m, n)) { if (s[n - i - 1] != t[i]) break; v[i] = 1; } lazy_segtree<int, my_min, e, int, my_min, my_min, e> seg(v); vector<int> r = manachar_even(t); rep(i, m - 1) { seg.apply(i + 1, i + r[i] + 1, seg.get(i) + 1); } int ans = seg.get(m - 1); cout << (ans == INF ? -1 : ans) << "\n"; } int main() { solve(); }