#852687 (C++17) No.2254 Reverse Only

提出ソース

結果

問題	No.2254 Reverse Only
ユーザー	minato
提出日時	2023-03-24 22:33:13
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	86 ms / 2,000 ms
コード長	14,937 bytes
コンパイル時間	2,065 ms
コンパイル使用メモリ	163,108 KB
実行使用メモリ	12,268 KB
最終ジャッジ日時	2023-10-18 21:18:04
合計ジャッジ時間	5,930 ms
ジャッジサーバーID （参考情報）	judge14 / judge12

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,348 KB
testcase_01	AC	2 ms 4,348 KB
testcase_02	AC	2 ms 4,348 KB
testcase_03	AC	2 ms 4,348 KB
testcase_04	AC	2 ms 4,348 KB
testcase_05	AC	2 ms 4,348 KB
testcase_06	AC	2 ms 4,348 KB
testcase_07	AC	2 ms 4,348 KB
testcase_08	AC	72 ms 6,404 KB
testcase_09	AC	86 ms 12,268 KB
testcase_10	AC	58 ms 12,268 KB
testcase_11	AC	72 ms 6,404 KB
testcase_12	AC	73 ms 6,404 KB
testcase_13	AC	84 ms 12,268 KB
testcase_14	AC	85 ms 12,268 KB
testcase_15	AC	85 ms 12,268 KB
testcase_16	AC	82 ms 12,268 KB
testcase_17	AC	83 ms 12,260 KB
testcase_18	AC	72 ms 6,404 KB
testcase_19	AC	58 ms 6,404 KB
testcase_20	AC	72 ms 12,268 KB
testcase_21	AC	68 ms 12,268 KB
testcase_22	AC	43 ms 12,260 KB
testcase_23	AC	58 ms 12,260 KB
testcase_24	AC	55 ms 12,268 KB
testcase_25	AC	58 ms 12,268 KB
testcase_26	AC	59 ms 12,268 KB
testcase_27	AC	4 ms 4,348 KB
testcase_28	AC	16 ms 4,348 KB
testcase_29	AC	39 ms 7,640 KB
testcase_30	AC	30 ms 4,556 KB
testcase_31	AC	20 ms 5,636 KB
testcase_32	AC	23 ms 5,900 KB
testcase_33	AC	11 ms 4,920 KB
testcase_34	AC	51 ms 8,784 KB
testcase_35	AC	33 ms 6,956 KB
testcase_36	AC	60 ms 5,876 KB
testcase_37	AC	64 ms 6,140 KB
testcase_38	AC	16 ms 5,204 KB
testcase_39	AC	57 ms 5,612 KB
testcase_40	AC	4 ms 4,348 KB
testcase_41	AC	30 ms 6,636 KB
testcase_42	AC	18 ms 5,352 KB
testcase_43	AC	55 ms 9,156 KB
testcase_44	AC	78 ms 11,716 KB
testcase_45	AC	42 ms 5,084 KB
testcase_46	AC	4 ms 4,348 KB

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

ソースコード

raw source code

#line 1 "library-cpp/other/template.hpp"
// clang-format off
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
template <class T> using maxheap = priority_queue<T>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vector<T>>;
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP0(n) for (auto minato = decay_t<decltype(n)>{}; minato < (n); ++minato)
#define REP1(i, n) for (auto i = decay_t<decltype(n)>{}; (i) < (n); (i)++)
#define REP2(i, l, r) for (auto i = (l); (i) < (r); (i)++)
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)
#define OVERLOAD_RREP(_1, _2, _3, name, ...) name
#define RREP1(i, n) for (auto i = (n) - 1; (i) >= decay_t<decltype(n)>{}; (i)--)
#define RREP2(i, l, r) for (auto i = (r) - 1; (i) >= (l); (i)--)
#define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP2, RREP1)(__VA_ARGS__)
#define all(x) begin(x), end(x)
template <class Container> int SZ(const Container& v) { return int(v.size()); }
template <class T> void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template <class T> T MAX(const vector<T>& v) { return *max_element(v.begin(), v.end()); }
template <class T> T MIN(const vector<T>& v) { return *min_element(v.begin(), v.end()); }
template <class T> T SUM(const vector<T>& v) { return accumulate(v.begin(), v.end(), T(0)); }
template <class T> T ABS(T x) { return max(x, -x); }
template <class T1, class T2> bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; }
template <class T1, class T2> bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; }
int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); }
int popcount(ull x) { return __builtin_popcountll(x); }
int kthbit(ull x, int k) { return (x >> k) & 1; }
constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x - 1) * 10; }
template <typename S> void rearrange(const vector<S>& id) { (void)id; }
template <typename S, typename T> void rearrange_exec(const vector<S>& id, vector<T>& v) { vector<T> w(v.size()); for (size_t i = 0; i < id.size(); i++) { w[i] = v[id[i]]; } v.swap(w); }
template <typename S, typename Head, typename... Tail> void rearrange(const vector<S>& id, Head& a, Tail& ...tail) { rearrange_exec(id, a); rearrange(id, tail...); }
istream& operator>>(istream& is, __int128_t& x) {
    x = 0;
    string s;
    is >> s;
    int n = int(s.size()), it = 0;
    if (s[0] == '-') it++;
    for (; it < n; it++) x = (x * 10 + s[it] - '0');
    if (s[0] == '-') x = -x;
    return is;
}
ostream& operator<<(ostream& os, __int128_t x) {
    if (x == 0) return os << 0;
    if (x < 0) os << '-', x = -x;
    deque<int> deq;
    while (x) deq.emplace_front(x % 10), x /= 10;
    for (int e : deq) os << e;
    return os;
}
template <class T> vector<T> &operator++(vector<T>& v) { for (auto& e : v) { e++; } return v;} 
template <class T> vector<T> operator++(vector<T>& v, int) { auto res = v; for (auto& e : v) { e++; } return res; }
template <class T> vector<T> &operator--(vector<T>& v) { for (auto& e : v) { e--; } return v; }
template <class T> vector<T> operator--(vector<T>& v, int) { auto res = v; for (auto& e : v) { e--; } return res; }
template <class T1, class T2> pair<T1, T2> operator-(const pair<T1, T2>& x) { return pair<T1, T2>(-x.first, -x.second); }
template <class T1, class T2> pair<T1, T2> operator-(const pair<T1, T2>& x, const pair<T1, T2>& y) { return pair<T1, T2>(x.first - y.first, x.second - y.second); }
template <class T1, class T2> pair<T1, T2> operator+(const pair<T1, T2>& x, const pair<T1, T2>& y) { return pair<T1, T2>(x.first + y.first, x.second + y.second); }
template <class T1, class T2> pair<T1, T2> operator+=(pair<T1, T2>& l, const pair<T1, T2>& r) { return l = l + r; }
template <class T1, class T2> pair<T1, T2> operator-=(pair<T1, T2>& l, const pair<T1, T2>& r) { return l = l - r; }
constexpr char ln = '\n';
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
void YES(bool t = true) { cout << YESNO[t] << "\n"; }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = true) { cout << YesNo[t] << "\n"; }
void No(bool t = 1) { Yes(!t); }
template <class T> void drop(T x) { cout << x << "\n"; exit(0); }
#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 LDB(...)             \
    long double __VA_ARGS__; \
    IN(__VA_ARGS__)
#define VEC(type, name, size) \
    vector<type> name(size);  \
    IN(name)
#define VEC2(type, name1, name2, size)     \
    vector<type> name1(size), name2(size); \
    for (int i = 0; i < size; i++) IN(name1[i], name2[i])
#define VEC3(type, name1, name2, name3, size)           \
    vector<type> name1(size), name2(size), name3(size); \
    for (int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])
#define VEC4(type, name1, name2, name3, name4, size)                 \
    vector<type> name1(size), name2(size), name3(size), name4(size); \
    for (int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);
#define VV(type, name, N, M)                       \
    vector<vector<type>> name(N, vector<type>(M)); \
    IN(name)
template <class T> void scan(T& a) { cin >> a; }
template <class T> void scan(vector<T>& a) { for (auto& i : a) scan(i); }
void IN() {}
template <class Head, class... Tail> void IN(Head& head, Tail&... tail) { scan(head); IN(tail...); }
void print() { cout << "\n"; }
template <class T> void print(const vector<T>& v) { for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) { cout << " "; } cout << *it; } print(); }
template <class T, class... Args> void print(const T& x, const Args& ... args) { cout << x; if (sizeof...(Args)) cout << " "; print(args...); }
#ifdef MINATO_LOCAL
template <class T1, class T2> ostream& operator<<(ostream& os, pair<T1, T2> p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <size_t N, class TUPLE> void debug_tuple(ostream& os, TUPLE _) { (void)os; (void)_; }
template <size_t N, class TUPLE, class T, class ...Args> void debug_tuple(ostream &os, TUPLE t) { os << (N == 0 ? "" : ", ") << get<N>(t); debug_tuple<N + 1, TUPLE, Args...>(os, t); }
template <class ...Args> ostream& operator<<(ostream& os, tuple<Args...> t) { os << "("; debug_tuple<0, tuple<Args...>, Args...>(os, t); return os << ")"; }
string debug_delim(int& i) { return i++ == 0 ? "" : ", "; }
#define debug_embrace(x) { int i = 0; os << "{";  { x } return os << "}"; }
template <class T> ostream& operator<<(ostream& os, vector<T> v) { debug_embrace( for (T e : v) { os << debug_delim(i) << e; } ) }
template <class T, size_t N> ostream& operator<<(ostream& os, array<T, N> a) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }
template <class T, size_t N> enable_if_t<!is_same_v<char, remove_cv_t<T>>, ostream>& operator<<(ostream& os, T(&a)[N]) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }
template <class Key> ostream& operator<<(ostream& os, set<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }
template <class Key, class T> ostream& operator<<(ostream& os, map<Key, T> mp) { debug_embrace( for (auto e : mp) { os << debug_delim(i) << e; }) }
template <class Key> ostream& operator<<(ostream& os, multiset<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }
template <class T> ostream& operator<<(ostream& os, queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.front(); } ) }
template <class T> ostream& operator<<(ostream& os, deque<T> q) { debug_embrace( for (T e : q) { os << debug_delim(i) << e; } ) }
template <class T> ostream& operator<<(ostream& os, priority_queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }
template <class T> ostream& operator<<(ostream& os, priority_queue<T, vector<T>, greater<T>> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }
void debug_out() { cerr << endl; }
template <class T, class... Args> void debug_out(const T& x, const Args& ... args) { cerr << " " << x; debug_out(args...); }
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// clang-format on
#line 2 "C.cpp"

struct ModInt61 {
    static constexpr ull MD = (1ULL << 61) - 1;
    using M = ModInt61;
    static constexpr ull get_mod() {
        return MD;
    }
    ull v;
    ModInt61(ll _v = 0) {
        set_v(_v % MD + MD);
    }
    M& set_v(ull _v) {
        v = (_v < MD) ? _v : _v - MD;
        return *this;
    }
    ull val() const {
        return v;
    }
    explicit operator bool() const {
        return v != 0;
    }
    M operator-() const {
        return M() - *this;
    }
    M operator+(const M& r) const {
        return M().set_v(v + r.v);
    }
    M operator-(const M& r) const {
        return M().set_v(v + MD - r.v);
    }
    M operator*(const M& r) const {
        __uint128_t z = __uint128_t(v) * r.v;
        return M().set_v(ull((z & ((1ULL << 61) - 1)) + (z >> 61)));
    }
    M operator/(const M& r) const {
        return *this * r.inv();
    }
    M& operator+=(const M& r) {
        return *this = *this + r;
    }
    M& operator-=(const M& r) {
        return *this = *this - r;
    }
    M& operator*=(const M& r) {
        return *this = *this * r;
    }
    M& operator/=(const M& r) {
        return *this = *this / r;
    }
    bool operator==(const M& r) const {
        return v == r.v;
    }
    M pow(ll n) const {
        M x = *this, r = 1;
        while (n) {
            if (n & 1) r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    M inv() const {
        return pow(MD - 2);
    }
    friend ostream& operator<<(ostream& os, const M& r) {
        return os << r.v;
    }
};

struct RollingHash {
  public:
    static inline ull generate_base() {
        mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
        uniform_int_distribution<ull> rand(0ULL, ModInt61::get_mod() - 1);
        return rand(mt);
    }

    RollingHash(int n, ull base) : n_(n), power(n + 1, 1), base_(base) {
        for (int i = 0; i < n; i++) {
            power[i + 1] = power[i] * base_;
        }
    }

    int size() const {
        return n_ + 1;
    }

    ModInt61 operator[](int i) const {
        assert(0 <= i and i <= n_);
        return power[i];
    }

    ModInt61 get_base() const {
        return base_;
    }

    template <class String, int base_num = 1>
    vector<ModInt61> get_hash(const String& s) const {
        int n = int(s.size());
        assert(n <= n_);
        vector<ModInt61> ret(n + 1);
        for (int i = 0; i < n; i++) {
            ret[i + 1] = ret[i] * base_ + s[i] + base_num;
        }
        return ret;
    }

    // [l,r) (0-indexed)
    ModInt61 getrange(const vector<ModInt61>& hash, int l, int r) const {
        if (l >= r) return ModInt61(0);
        assert(0 <= l and r <= n_);
        return hash[r] - hash[l] * power[r - l];
    }

    template <class String, int base_num = 1>
    ModInt61 getval(const String& s) const {
        int n = int(s.size());
        assert(n <= n_);
        ModInt61 ret = 0;
        for (int i = 0; i < n; i++) {
            ret = ret * base_ + s[i] + base_num;
        }
        return ret;
    }

    ModInt61 concat(ModInt61 hl, ModInt61 hr, int rlen) const {
        assert(rlen <= n_);
        return hl * power[rlen] + hr;
    }

    int LCP(const vector<ModInt61>& a,
            const vector<ModInt61>& b,
            int l1,
            int r1,
            int l2,
            int r2) const {
        assert(0 <= l1 and l1 < r1 and r1 < int(a.size()));
        assert(0 <= l2 and l2 < r2 and r2 < int(b.size()));
        int len = min(r1 - l1, r2 - l2);
        int low = -1, high = len + 1;
        while (high - low > 1) {
            int mid = (low + high) / 2;
            if (getrange(a, l1, l1 + mid) == getrange(b, l2, l2 + mid))
                low = mid;
            else
                high = mid;
        }
        return low;
    }

  private:
    int n_;
    vector<ModInt61> power;
    ModInt61 base_;
};
void experince() {
    int N = 6;
    int K = 5;
    vec<int> ids(N);
    iota(all(ids), 0);

    queue<vec<int>> que;
    que.emplace(ids);
    set<vec<int>> dic;
    dic.emplace(ids);
    while (!que.empty()) {
        auto v = que.front();
        que.pop();
        rep(i, N) {
            rep(j, i + K, N + 1) {
                vec<int> nv = v;
                reverse(nv.begin() + i, nv.begin() + j);
                if (dic.count(nv)) continue;
                dic.emplace(nv);
                que.emplace(nv);
            }
        }
    }
    debug(dic.size());
    for (auto v : dic) {
        debug(v);
    }
}

bool check(vec<int> A, vec<int> B) {
    sort(all(A));
    sort(all(B));
    return A == B;
}
void solve() {
    INT(N, K);
    VEC(int, A, N);
    VEC(int, B, N);
    if (!check(A, B)) drop("No");

    if (N - K >= 2) drop("Yes");

    rep(i, N) A.emplace_back(A[i]);

    auto base = RollingHash::generate_base();
    RollingHash rh(N * 2, base);
    auto ha = rh.get_hash(A);
    auto b = rh.getval(B);
    reverse(all(B));
    auto rb = rh.getval(B);

    rep(i, N) {
        auto a = rh.getrange(ha, i, i + N);
        if (a == b or a == rb) drop("Yes");
    }
    drop("No");
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cerr << fixed << setprecision(7);

    // experince();
    int T = 1;
    // cin >> T;
    for (int test_case = 1; test_case <= T; test_case++) {
        // debug(test_case);
        solve();
    }
}

yukicoder

結果

テストケース

ソースコード