結果

問題 No.2254 Reverse Only
ユーザー hamathhamath
提出日時 2023-03-24 22:17:45
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 231 ms / 2,000 ms
コード長 6,601 bytes
コンパイル時間 2,998 ms
コンパイル使用メモリ 247,040 KB
実行使用メモリ 30,764 KB
最終ジャッジ日時 2024-09-18 17:14:32
合計ジャッジ時間 7,200 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 1 ms
6,940 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 214 ms
23,680 KB
testcase_09 AC 59 ms
29,924 KB
testcase_10 AC 37 ms
7,936 KB
testcase_11 AC 231 ms
23,552 KB
testcase_12 AC 218 ms
23,680 KB
testcase_13 AC 37 ms
7,936 KB
testcase_14 AC 37 ms
7,936 KB
testcase_15 AC 37 ms
7,936 KB
testcase_16 AC 54 ms
25,920 KB
testcase_17 AC 56 ms
25,064 KB
testcase_18 AC 210 ms
23,808 KB
testcase_19 AC 55 ms
7,936 KB
testcase_20 AC 59 ms
30,764 KB
testcase_21 AC 59 ms
29,916 KB
testcase_22 AC 45 ms
29,928 KB
testcase_23 AC 60 ms
29,728 KB
testcase_24 AC 53 ms
25,548 KB
testcase_25 AC 55 ms
25,992 KB
testcase_26 AC 54 ms
25,276 KB
testcase_27 AC 3 ms
6,940 KB
testcase_28 AC 40 ms
9,088 KB
testcase_29 AC 19 ms
6,940 KB
testcase_30 AC 76 ms
13,312 KB
testcase_31 AC 10 ms
6,944 KB
testcase_32 AC 11 ms
6,940 KB
testcase_33 AC 6 ms
6,940 KB
testcase_34 AC 22 ms
6,940 KB
testcase_35 AC 15 ms
6,944 KB
testcase_36 AC 189 ms
21,504 KB
testcase_37 AC 185 ms
21,888 KB
testcase_38 AC 8 ms
6,940 KB
testcase_39 AC 156 ms
20,480 KB
testcase_40 AC 3 ms
6,944 KB
testcase_41 AC 14 ms
6,940 KB
testcase_42 AC 9 ms
6,940 KB
testcase_43 AC 25 ms
6,940 KB
testcase_44 AC 35 ms
7,680 KB
testcase_45 AC 111 ms
16,896 KB
testcase_46 AC 3 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifdef LOCAL
//#define _GLIBCXX_DEBUG
#else
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#endif

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

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<VP> VVP;
typedef vector<Vec> VV;
typedef vector<Vi> VVi;
typedef vector<Vc> VVc;
typedef vector<VV> VVV;
typedef vector<VVV> VVVV;
#define MAKEVV(variable, a, ...) VV variable(a, Vec(__VA_ARGS__))
#define MAKEVVc(variable, a, ...) VVc variable(a,Vc(__VA_ARGS__))
#define MAKEVVV(variable, a, b, ...) VVV variable(a, VV(b, Vec(__VA_ARGS__)))
#define MAKEVVVV(variable, a, b, c, ...) VVVV variable(a, VVV(b, (VV(c, Vec(__VA_ARGS__)))))

#define endl '\n'
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 4'000'000'000'000'000'010LL;
const ll MOD=998244353;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#define SUM(a) accumulate(ALL(a),0LL)
#define outminusone(a) cout<< ( a==INF ? -1 : a ) <<endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<class T>auto lb(vector<T> &X, T x){return lower_bound(ALL(X),x) - X.begin();}
template<class T>auto ub(vector<T> &X, T x){return upper_bound(ALL(X),x) - X.begin();}
ll popcnt(ll x){return __builtin_popcount(x);}
ll topbit(ll t){return t==0?-1:63-__builtin_clzll(t);}
ll floor(ll y,ll x){assert(x != 0);if(x < 0){y *= -1; x *= -1;}if(y < 0){return (y-x+1)/x;}return y/x;};
ll ceil(ll y, ll x){assert(x != 0);if(x < 0){y *= -1; x *= -1;}if(y < 0){return y/x;}return (y+x-1)/x;};

template<typename T1, typename T2>istream &operator>>(istream &i, pair<T1, T2> &p) { return i>>p.first>>p.second; }
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T1, typename T2>ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }
template<class T>ostream &operator<<(ostream &os, const vector<T> &v) {bool f = false;for(const auto &d: v) {if(f) os<<" ";f = true;os<<d;}return os;}
template <class T> ostream& operator<<(ostream& os, const set<T>& s) {os << "{";bool f = false;for (auto d : s) {if (f) os << ", ";f = true;os << d;}return os << "}";}
template <class T> ostream& operator<<(ostream& os, const multiset<T>& s) {os << "{";bool f = false;for (auto d : s) {if (f) os << ", ";f = true;os << d;}return os << "}";}
template<class T, class U>ostream &operator<<(ostream &os, const map<T, U> &s) {bool f = false;os<<endl;for(auto p: s) {if(f) os<<endl;f = true;os<<p.first<<": "<<p.second;}return os<<endl;}
void out() { cout << endl; }
template <class Head, class... Tail> void out(const Head &head, const Tail &...tail) {cout << head;if(sizeof...(tail)) cout << ' ';out(tail...);}

#ifdef LOCAL
template<typename T>ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {int len=vv.size();for(int i=0; i<len; ++i) {if(i==0)s<<endl;s<<i<<":"<<vv[i];if(i!=len-1)s<<endl;}return s;}
struct PrettyOS {ostream& os;bool first;template <class T> auto operator<<(T&& x) {if (!first) os << ", ";first = false;os << x;return *this;}};
template <class... T> void dbg0(T&&... t) {(PrettyOS{cerr, true} << ... << t);}
#define dbg(...)do {cerr << #__VA_ARGS__ << ":  ";dbg0(__VA_ARGS__);cerr << endl;} while (false);
#else
#define dbg(...)
#endif

void simulate(){
    ll n = 6;
    Vec a(n);
    iota(ALL(a),1);
    map<Vec,ll> mp;
    ll k = 5;
    ll T = 60000;
    auto rand = [](ll n)->ll{
        random_device rd;
        mt19937 mt(rd());
        return mt()%n;
    };
    rep(_,T){
        ll j = rand(n)+1;
        ll i = rand(j);
        if(j-i < k)continue;
        reverse(a.begin()+i,a.begin()+j);
        mp[a]++;
    }
    dbg(mp);
    dbg(mp.size());
    ::exit(0);
}

// Reference:
// D. Gusfield,
// Algorithms on Strings, Trees, and Sequences: Computer Science and
// Computational Biology
template <class T> std::vector<int> z_algorithm(const std::vector<T>& s) {
    int n = int(s.size());
    if (n == 0) return {};
    std::vector<int> z(n);
    z[0] = 0;
    for (int i = 1, j = 0; i < n; i++) {
        int& k = z[i];
        k = (j + z[j] <= i) ? 0 : std::min(j + z[j] - i, z[i - j]);
        while (i + k < n && s[k] == s[i + k]) k++;
        if (j + z[j] < i + z[i]) j = i;
    }
    z[0] = n;
    return z;
}

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


int solve(){
    //simulate();
    ll n;
    cin>>n;
    ll k;
    cin>>k;
    Vec a(n);
    Vec b(n);
    cin>>a>>b;
    Vec ra = a;
    reverse(ALL(ra));
    if(k > n){
        //完全一致
        Yes(a == b);
    }else if(k == n){
        Yes(a == b or ra == b);
    }else if(k == n-1){
        auto judge = [&](Vec v)->bool{
            ll sz = v.size();
            Vi z = z_algorithm(v);
            bool ok = false;
            dbg(z);
            REP(i,n+1,sz){
                if(z[i] >= n){
                    ok = true;
                    break;
                }
            }
            return ok;
        };
        Vec d = {n+1};
        Vec X = a;
        Vec Y = ra;
        X.pb(n+1);
        Y.pb(n+1);
        rep(_,2){
            rep(i,n){
                X.pb(b[i]);
                Y.pb(b[i]);
            }
        }
        dbg(X)
        dbg(Y)
        Yes(judge(X) or judge(Y));
    }else{
        map<ll,ll>mpa;
        map<ll,ll>mpb;
        rep(i,n){
            mpa[a[i]]++;
            mpb[b[i]]++;
        }
        Yes(mpa == mpb);
    }
    return  0;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout<<std::setprecision(20);
//    ll T;
//    cin>>T;
//    while(T--)
    solve();
}
0