#852511 (C++23) No.2254 Reverse Only

提出ソース

結果

問題	No.2254 Reverse Only
ユーザー	👑 hitonanode
提出日時	2023-03-24 21:51:45
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	71 ms / 2,000 ms
コード長	9,366 bytes
コンパイル時間	2,433 ms
コンパイル使用メモリ	196,856 KB
実行使用メモリ	14,464 KB
最終ジャッジ日時	2023-10-18 20:59:46
合計ジャッジ時間	5,760 ms
ジャッジサーバーID （参考情報）	judge15 / judge13

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
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	71 ms 5,276 KB
testcase_09	AC	53 ms 14,464 KB
testcase_10	AC	41 ms 5,276 KB
testcase_11	AC	71 ms 5,276 KB
testcase_12	AC	71 ms 5,276 KB
testcase_13	AC	41 ms 5,276 KB
testcase_14	AC	40 ms 5,276 KB
testcase_15	AC	41 ms 5,276 KB
testcase_16	AC	53 ms 14,464 KB
testcase_17	AC	53 ms 14,456 KB
testcase_18	AC	71 ms 5,276 KB
testcase_19	AC	57 ms 5,276 KB
testcase_20	AC	53 ms 14,464 KB
testcase_21	AC	53 ms 14,464 KB
testcase_22	AC	39 ms 14,456 KB
testcase_23	AC	53 ms 14,456 KB
testcase_24	AC	51 ms 14,464 KB
testcase_25	AC	53 ms 14,464 KB
testcase_26	AC	54 ms 14,464 KB
testcase_27	AC	3 ms 4,348 KB
testcase_28	AC	16 ms 4,348 KB
testcase_29	AC	20 ms 4,436 KB
testcase_30	AC	29 ms 4,348 KB
testcase_31	AC	11 ms 4,348 KB
testcase_32	AC	12 ms 4,348 KB
testcase_33	AC	6 ms 4,348 KB
testcase_34	AC	25 ms 4,644 KB
testcase_35	AC	17 ms 4,348 KB
testcase_36	AC	60 ms 5,036 KB
testcase_37	AC	63 ms 5,092 KB
testcase_38	AC	9 ms 4,348 KB
testcase_39	AC	56 ms 4,940 KB
testcase_40	AC	3 ms 4,348 KB
testcase_41	AC	15 ms 4,348 KB
testcase_42	AC	9 ms 4,348 KB
testcase_43	AC	27 ms 4,708 KB
testcase_44	AC	38 ms 5,172 KB
testcase_45	AC	42 ms 4,620 KB
testcase_46	AC	3 ms 4,348 KB

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

ソースコード

raw source code

#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 lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif


void expe(int N, int K) {
    vector<int> vs;
    REP(i, N) vs.push_back(i);
    set<vector<int>> seen;
    queue<vector<int>> q;
    q.push(vs);
    seen.insert(vs);
    while (q.size()) {
        auto now = q.front();
        q.pop();
        FOR(w, K, N + 1) {
            REP(l, N - w + 1) {
                auto nxt = now;
                reverse(nxt.begin() + l, nxt.begin() + l + w);
                if (seen.count(nxt)) continue;
                seen.insert(nxt);
                q.push(nxt);
            }
        }
    }
    dbg(make_tuple(N, K, seen.size()));
    dbg(seen);
}

void Yes() {
    puts("Yes");
    exit(0);
}
void No() {
    puts("No");
    exit(0);
}

// Z algorithm (length of longest common prefix for s[0:N] & s[i:N] for each i)
// Input: std::vector<T> / std::string of length N
// Output: std::vector<int> of size N
// Complexity: O(N)
// Sample:
// - `teletelepathy` -> [13, 0, 0, 0, 4, 0, 0, 0, 0, 0, 1, 0, 0]
// Reference: <http://snuke.hatenablog.com/entry/2014/12/03/214243>
template <typename T> std::vector<int> z_algorithm(const std::vector<T> &s) {
    const int N = s.size();
    if (N == 0) return {};
    std::vector<int> ans(N);
    ans[0] = N;
    int i = 1, j = 0;
    while (i < N) {
        while (i + j < N and s[j] == s[i + j]) ++j;
        ans[i] = j;
        if (!j) {
            ++i;
            continue;
        }
        int k = 1;
        while (i + k < N and k + ans[k] < j) ans[i + k] = ans[k], ++k;
        i += k;
        j -= k;
    }
    return ans;
}

std::vector<int> z_algorithm(const std::string &s) {
    const int N = int(s.size());
    std::vector<int> v(N);
    for (int i = 0; i < N; i++) v[i] = s[i];
    return z_algorithm(v);
}


int main() {
    FOR(n, 1, 9) {
        expe(n, n - 1);
        // FOR(k, 1, n + 1) expe(n, k);
    }
    int N, K;
    cin >> N >> K;
    vector<int> A(N), B(N);
    cin >> A >> B;
    if (K + 2 <= N) {
        sort(ALL(A)), sort(ALL(B));
        if (A == B) Yes();
        No();
    }
    if (K > N) {
        if (A == B) Yes();
        No();
    }
    if (K == N) {
        if (A == B) Yes();
        reverse(ALL(A));
        if (A == B) Yes();
        No();
    }

    assert(K + 1 == N);

    auto z = A;
    REP(_, 2) {
        z.push_back(-1);
        z.insert(z.end(), ALL(B));
        z.insert(z.end(), ALL(B));
        reverse(ALL(B));
    }

    auto v = z_algorithm(z);
    int hi = *max_element(v.begin() + N + 1, v.end());
    if (hi >= N) Yes();
    No();
}

yukicoder

結果

テストケース

ソースコード