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

提出ソース

結果

問題	No.2254 Reverse Only
ユーザー	woodywoody
提出日時	2024-06-02 15:46:22
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,425 bytes
コンパイル時間	4,454 ms
コンパイル使用メモリ	280,248 KB
実行使用メモリ	14,324 KB
最終ジャッジ日時	2024-06-02 15:46:32
合計ジャッジ時間	8,902 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	1 ms 5,376 KB
testcase_08	AC	69 ms 8,064 KB
testcase_09	AC	179 ms 14,096 KB
testcase_10	AC	37 ms 5,376 KB
testcase_11	WA	-
testcase_12	AC	43 ms 5,376 KB
testcase_13	AC	35 ms 5,376 KB
testcase_14	AC	37 ms 5,376 KB
testcase_15	AC	36 ms 5,376 KB
testcase_16	AC	171 ms 14,072 KB
testcase_17	AC	174 ms 14,324 KB
testcase_18	AC	65 ms 6,528 KB
testcase_19	AC	56 ms 8,064 KB
testcase_20	AC	98 ms 8,780 KB
testcase_21	AC	103 ms 8,904 KB
testcase_22	AC	78 ms 8,896 KB
testcase_23	AC	92 ms 8,896 KB
testcase_24	AC	91 ms 8,892 KB
testcase_25	AC	94 ms 8,900 KB
testcase_26	AC	89 ms 9,020 KB
testcase_27	AC	3 ms 5,376 KB
testcase_28	AC	16 ms 5,376 KB
testcase_29	AC	18 ms 5,376 KB
testcase_30	AC	29 ms 5,376 KB
testcase_31	AC	10 ms 5,376 KB
testcase_32	AC	11 ms 5,376 KB
testcase_33	AC	6 ms 5,376 KB
testcase_34	AC	22 ms 5,376 KB
testcase_35	AC	16 ms 5,376 KB
testcase_36	AC	58 ms 7,296 KB
testcase_37	AC	61 ms 7,680 KB
testcase_38	AC	8 ms 5,376 KB
testcase_39	AC	54 ms 7,040 KB
testcase_40	AC	3 ms 5,376 KB
testcase_41	AC	14 ms 5,376 KB
testcase_42	AC	8 ms 5,376 KB
testcase_43	AC	24 ms 5,376 KB
testcase_44	AC	34 ms 5,376 KB
testcase_45	AC	40 ms 6,144 KB
testcase_46	AC	2 ms 5,376 KB

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

ソースコード

raw source code

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define assertmle(x) if (!(x)) {vi v(3e8);}
#define asserttle(x) if (!(x)) {while(1){}}
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 2001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#include "./debug/localDebug.cpp"
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show1(a) cerr<<#a<<" = "<<a<<endl
#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl
#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl
#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl
#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl
#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}
#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}
#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}
#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}
#else
#define showp(p)
#define show1(a)
#define show2(a,b)
#define show3(a,b,c)
#define show4(a,b,c,d)
#define show5(a,b,c,d,e)
#define DEBUG_LINE
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#define showmat(v)
#define showmatm(v)
#endif
#define overload5(a,b,c,d,e,f, ...) f
#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)

const ull MASK30 = (1UL << 30) - 1;
const ull MASK31 = (1UL << 31) - 1;
const ull MOD = ((ull)1 << 61) - 1;
const ull MASK61 = MOD;
ull BASE = 31; //基底
vector<ull> CharToHash; //英小文字 → hash
unordered_map<ull,char> HashToChar; //hash → 英小文字
unordered_map<ull,int> idx; //hash-index(挿入順番号)

ull CalcMod(ull x);
ull PowMod(ull base, ull exp);
        
//a*b mod 2^61-1を返す関数(最後にModを取る)
ull Mul(ull a, ull b)
{
    a = (a + MOD) % MOD;
    b = (b + MOD) % MOD;
    ull au = a >> 31;
    ull ad = a & MASK31;
    ull bu = b >> 31;
    ull bd = b & MASK31;
    ull mid = ad * bu + au * bd;
    ull midu = mid >> 30;
    ull midd = mid & MASK30;
    return CalcMod(au * bu * 2 + midu + (midd << 31) + ad * bd);
}
//mod 2^61-1を計算する関数
ull CalcMod(ull x)
{
    ull xu = x >> 61;
    ull xd = x & MASK61;
    ull res = xu + xd;
    if (res >= MOD) res -= MOD;
    return res;
}
ull PowMod(ull base, ull exp) { // base^exp mod MOD
    if (exp == 0) {
        return 1;
    } else if (exp % 2 == 0) {
        ull t = PowMod(base, exp / 2);
        return Mul(t, t);
    } else {
        return Mul(base, PowMod(base, exp - 1));
    }
}

ll XorShift_base=(ll) time(NULL)%INT_MAX; ll y=362436069, z=521288629, w=88675123;
ll xor_shift() noexcept {
    ll t=(XorShift_base^(XorShift_base<<11));
    XorShift_base=y; y=z; z=w;
    return ( w=(w^(w>>19))^(t^(t>>8)) % INT_MAX );
}

void solve(){
    int n,k; cin>>n>>k;
    vi a(n),b(n);
    rep(i,n) cin>>a[i];
    rep(i,n) cin>>b[i];
    if (k==1 || k>n){
        yn(a==b);
        return;
    }else if(n==k){
        bool ok = false;
        if (a==b) ok = true;
        reverse(rng(a));
        if (a==b) ok = true;
        yn(ok);
        return;
    }
    vi _a = a;
    vi _b = b;
    sort(rng(_a));
    sort(rng(_b));
    if (_a!=_b) retval(No);

    vector<ull> p(n);
    p[0] = 1;
    rep1(i,n){
        p[i] = Mul(p[i-1], BASE);
    }

    if (k!=n-1){
        retval(Yes);
    }

    unordered_map<ll,ull> hash;
    rep(i,n){
        if (hash.count(a[i])) continue;
        hash[a[i]] = xor_shift();
    }
    rep(i,n){
        if (hash.count(b[i])) continue;
        hash[b[i]] = xor_shift();
    }


    auto f = [&](vi v)->bool{

        ull now = 0;
        rep(i,n){
            now = CalcMod(now+Mul(p[i], hash[v[i]]));
        }
        ull tar = 0;
        rep(i,n){
            tar = CalcMod(tar+Mul(p[i], hash[b[i]]));
        }

        bool ok = false;
        int id = n-1;
        rep(i,n){
            if (now==tar) ok = true;
            now = CalcMod(now + MOD - Mul(p[n-1], hash[v[id]]));
            now = Mul(now, BASE);
            now = CalcMod(now + hash[v[id]]);
            id = (id+n-1)%n;
        }
        return ok;
    };
    bool ok = false;
    ok |= f(a);
    reverse(rng(a));
    ok |= f(a);
    yn(ok);

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}

yukicoder

結果

テストケース

ソースコード