結果

問題 No.2254 Reverse Only
コンテスト
ユーザー 0214sh7
提出日時 2023-03-24 23:18:12
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 487 ms / 2,000 ms
コード長 6,478 bytes
コンパイル時間 2,671 ms
コンパイル使用メモリ 211,368 KB
最終ジャッジ日時 2025-02-11 17:43:40
ジャッジサーバーID
（参考情報） 		judge2 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 47
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PP;
//#define MOD 1000000007
#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;i<=(n);++i)
#define RREP(i,n) for(ll i=(n)-1;i>=0;--i)
#define ALL(v) (v).begin(), (v).end()
#define GOODBYE do { cout << "-1" << endl; return 0; } while (false)
#define MM <<" "<<
#define Endl endl
#define debug true
#define debug2 false


class rollinghash{
    /*
    Copyright (c) 2022 0214sh7
    https://github.com/0214sh7/library/
    */
    private:
    static constexpr long long mod = (1LL << 61)-1;
    std::vector<long long> Base = {12345,10000000};
    std::vector<long long> BaseInv;
    std::vector<std::vector<long long>> BaseInvExp;
    static constexpr long long h = 100;
    
    long long product(long long a,long long b){
        static constexpr long long m = 1LL << 31;
        long long a1 = a/m,a2 = a%m;
        long long b1 = b/m,b2 = b%m;
        
        long long r = 0 , s;
        r = (r + 2*a1*b1) % mod;
        s = (a1*b2 + b1*a2) % mod;
        long long s1 = s/m,s2 = s%m;
        s = (2*s1+m*s2) % mod;
        r = (r + s) % mod;
        r = (r + a2*b2) % mod;
        
        return r;
    }
    
    long long power(long long b,long long e){
        long long r=1;
        while(e){
            if(e&1){
                r=product(r,b)%mod;
            }
                b=product(b,b)%mod;
                e >>=1;
        }
        return r;
    }
    
    public:
    std::vector<long long> S;
    std::vector<std::vector<long long>> H,Hsum;
    
    void init(std::vector<long long> cs){
        S=cs;
        int n=S.size();
        
        BaseInv.resize(Base.size());
        BaseInvExp.resize(Base.size());
        H.resize(Base.size());
        Hsum.resize(Base.size());
        for(int i=0;i<Base.size();i++){
            BaseInvExp[i].assign(n+1,1);
            H[i].assign(n+1,0);
            Hsum[i].assign(n+1,0);
        }
        
        //逆元
        for(int i=0;i<Base.size();i++){
            BaseInv[i]=power(Base[i],mod-2);
        }
        for(int i=0;i<Base.size();i++){
            for(int j=0;j<n;j++){
                BaseInvExp[i][j+1] = product(BaseInvExp[i][j],BaseInv[i]);
            }
        }
        
        //本体
        for(int i=0;i<Base.size();i++){
            long long b=1;
            for(int j=0;j<n;j++){
                H[i][j]=product(b,S[j]+h);
                b=product(b,Base[i]);
            }
        }
        
        //累積和
        for(int i=0;i<Base.size();i++){
            for(int j=0;j<n;j++){
                Hsum[i][j+1]=(Hsum[i][j]+H[i][j])%mod;
            }
        }
    }
    
    rollinghash(std::vector<long long> S){
        init(S);
    }
    
    std::vector<long long> get(int l,int r){
        std::vector<long long> R(Base.size());
        for(int i=0;i<Base.size();i++){
            long long g = (Hsum[i][r]-Hsum[i][l]+mod)%mod;
            g=product(g,BaseInvExp[i][l]);
            R[i] = g;
        }
        return R;
    }
    
    std::vector<long long> instant(std::vector<long long> P){
        std::vector<long long> R;
        for(int i=0;i<Base.size();i++){
            long long r = 0, b = 1;
            for(int j=0;j<P.size();j++){
                r = (r+product(b,P[j]+h))%mod;
                b = product(b,Base[i]);
            }
            R.push_back(r);
        }
        return R;
    }
    
    std::vector<long long> connect(std::vector<long long> P,long long ps,std::vector<long long> Q,long long qs){
        std::vector<long long> R;
        for(int i=0;i<Base.size();i++){
            long long r = (product(Q[i],power(Base[i],ps))+P[i])%mod;
            R.push_back(r);
        }
        return R;
    }
    
};

int main(void){
    //cin.tie(nullptr);
    //ios::sync_with_stdio(false);
    
    ll N,K;
    cin >> N >> K;
    vector<ll> A(N),B(N);
    REP(i,N){cin >> A[i];}
    REP(i,N){cin >> B[i];}
    
    vector<ll> sA = A,sB = B;
    sort(ALL(sA));
    sort(ALL(sB));
    
    if(sA!=sB){
        cout << "No" << endl;
        return 0;
    }
    
    vector<ll> rB = B;reverse(ALL(rB));
    
    if(K<=N-2){
        cout << "Yes" << endl;
        return 0;
    }
    
    if(K==N){
        if(A==B || A==rB){
            cout << "Yes" << endl;
        }else{
            cout << "No" << endl;
        }
        return 0;
    }
    
    if(K>N){
        if(A==B){
            cout << "Yes" << endl;
        }else{
            cout << "No" << endl;
        }
        return 0;
    }
    
    
    rollinghash ROL(A);
    
    vector<ll> hB = ROL.instant(B),hrB = ROL.instant(rB);
    
    //REP(i,hB.size()){cout << hB[i] << " ";}cout << Endl;
    //REP(i,hB.size()){cout << hrB[i] << " ";}cout << Endl;cout << Endl;
    
    REP(i,N){
        vector<ll> S = ROL.get(0,i),T = ROL.get(i,N);
        vector<ll> R = ROL.connect(T,N-i,S,i);
        //REP(i,hB.size()){cout << R[i] << " ";}cout << Endl;
        
        if(R==hB || R==hrB){
            cout << "Yes" << endl;
            return 0;
        }
    }
    
    cout << "No" << endl;
    
    /*ll N = 5,K = 3;
    cin >> N >> K;
    map<vector<ll>,ll> ind;
    ll now = 0;
    vector<ll> d(N);
    REP(i,N){d[i] = i;}

    do{
        
        ind[d] = now;
        now++;
        
    }while(next_permutation(ALL(d)));
    
    queue<vector<ll>> que;
    vector<bool> enqueued(now,false);
    
    REP(i,N){d[i] = i;}
    que.push(d);
    enqueued[ind[d]] = true;
    
    while(!que.empty()){
        
        vector<ll> t = que.front();
        que.pop();
        
        for(ll l=0;l<N;l++){
            for(ll r=l;r<N;r++){
                
                if((r-l+1)<K)continue;
                vector<ll> R = t;
                for(ll e=l;e<=r;e++){
                    R[e] = t[l+r-e];
                }
                
                if(!enqueued[ind[R]]){
                    que.push(R);
                    enqueued[ind[R]] = true;
                }
                
            }
        }
        
    }
    
    
    REP(i,N){d[i] = i;}
    ll c = 0;
    do{
        if(enqueued[ind[d]]){
            REP(i,N){
                cout << d[i] << " ";
            }
            cout << endl;
            c++;
        }
    }while(next_permutation(ALL(d)));
    
    cout << c MM (now-c) << endl;*/
    
    return 0;
}
0