#810007 (C++14) No.2102 [Cherry Alpha *] Conditional Reflection

提出ソース

結果

問題	No.2102 [Cherry Alpha *] Conditional Reflection
ユーザー	woodywoody
提出日時	2022-10-22 13:17:32
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	960 ms / 3,000 ms
コード長	6,592 bytes
コンパイル時間	4,754 ms
コンパイル使用メモリ	255,220 KB
実行使用メモリ	12,820 KB
最終ジャッジ日時	2024-07-01 15:32:33
合計ジャッジ時間	48,399 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	448 ms 8,092 KB
testcase_03	AC	478 ms 8,336 KB
testcase_04	AC	446 ms 8,096 KB
testcase_05	AC	354 ms 6,944 KB
testcase_06	AC	490 ms 8,092 KB
testcase_07	AC	460 ms 6,944 KB
testcase_08	AC	189 ms 6,944 KB
testcase_09	AC	432 ms 8,216 KB
testcase_10	AC	231 ms 6,940 KB
testcase_11	AC	169 ms 6,940 KB
testcase_12	AC	342 ms 6,940 KB
testcase_13	AC	540 ms 8,712 KB
testcase_14	AC	386 ms 6,940 KB
testcase_15	AC	540 ms 8,096 KB
testcase_16	AC	673 ms 9,364 KB
testcase_17	AC	313 ms 6,944 KB
testcase_18	AC	482 ms 6,944 KB
testcase_19	AC	268 ms 6,940 KB
testcase_20	AC	582 ms 8,980 KB
testcase_21	AC	310 ms 6,944 KB
testcase_22	AC	714 ms 9,876 KB
testcase_23	AC	728 ms 9,880 KB
testcase_24	AC	711 ms 9,876 KB
testcase_25	AC	722 ms 9,876 KB
testcase_26	AC	710 ms 9,872 KB
testcase_27	AC	720 ms 9,872 KB
testcase_28	AC	713 ms 9,944 KB
testcase_29	AC	731 ms 10,004 KB
testcase_30	AC	711 ms 9,876 KB
testcase_31	AC	716 ms 9,876 KB
testcase_32	AC	708 ms 9,876 KB
testcase_33	AC	717 ms 9,876 KB
testcase_34	AC	716 ms 9,752 KB
testcase_35	AC	723 ms 9,876 KB
testcase_36	AC	723 ms 10,004 KB
testcase_37	AC	728 ms 9,876 KB
testcase_38	AC	743 ms 9,880 KB
testcase_39	AC	726 ms 9,872 KB
testcase_40	AC	705 ms 9,876 KB
testcase_41	AC	724 ms 9,880 KB
testcase_42	AC	536 ms 8,200 KB
testcase_43	AC	542 ms 8,204 KB
testcase_44	AC	544 ms 8,200 KB
testcase_45	AC	527 ms 8,204 KB
testcase_46	AC	532 ms 8,204 KB
testcase_47	AC	493 ms 6,940 KB
testcase_48	AC	493 ms 6,944 KB
testcase_49	AC	499 ms 6,944 KB
testcase_50	AC	500 ms 6,940 KB
testcase_51	AC	494 ms 6,944 KB
testcase_52	AC	948 ms 6,940 KB
testcase_53	AC	950 ms 6,944 KB
testcase_54	AC	960 ms 6,940 KB
testcase_55	AC	637 ms 6,944 KB
testcase_56	AC	633 ms 6,940 KB
testcase_57	AC	630 ms 6,940 KB
testcase_58	AC	814 ms 6,940 KB
testcase_59	AC	739 ms 12,820 KB
testcase_60	AC	201 ms 6,944 KB
testcase_61	AC	633 ms 6,944 KB
testcase_62	AC	21 ms 6,940 KB
testcase_63	AC	377 ms 6,940 KB
testcase_64	AC	376 ms 6,944 KB
testcase_65	AC	390 ms 6,944 KB
testcase_66	AC	621 ms 6,940 KB
testcase_67	AC	483 ms 6,940 KB
testcase_68	AC	518 ms 6,944 KB
testcase_69	AC	483 ms 6,940 KB

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

ソースコード

raw source code

// #define _GLIBCXX_DEBUG
#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 fore1(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 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 1;} else {cout << "No" << endl; return 0;}}
#define dame { cout << "No" << endl; return 0;}
#define dame1 { cout << -1 << endl; return 0;}
#define test(x) cout << "test" << x << endl;
#define deb(x,y) cout << x << " " << y << endl;
#define debp(p) cout << p.fi << " " << p.se << endl;
#define deb3(x,y,z) cout << x << " " << y << " " << z << endl;
#define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << 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 show(x) cerr<<#x<<" = "<<x<<endl;
#define showdeb(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl;
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(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 tp = tuple<int ,int ,int>;
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 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 yesr { cout <<"Yes"<<endl; return 0;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return 0;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;

struct RollingHash{
    const ll MASK30 = (1UL << 30) - 1;
    const ll MASK31 = (1UL << 31) - 1;
    const ll MOD = (1UL << 61) - 1;
    const ll MASK61 = MOD;

    map<char,ll> CharHash; //英小文字ーhash
    unordered_map<ll,int> idx; //hash-index(挿入順番号)
    int str_num = 0; //挿入した文字列の総数
    ll Base; //基底

    RollingHash(){
        map<ll,int> tmp;
        ll mx = 0;
        rep(i,26){
            char c = 'a' + i;
            ll y = rand()+1;
            while(tmp.count(y)){
                y = rand()+1;
            }
            CharHash[c] = y;
            chmax(mx,y);
        }

        ll base_tmp = 37;
        while(1){
            int k = rand()+1;
            if (gcd(MOD,k) != 1) continue;
            Base = PowMod(base_tmp , k);
            if (Base <= mx) continue;
            break;
        }
    };

    //a*b mod 2^61-1を返す関数(最後にModを取る)
    ll Mul(ll a, ll b)
    {
        a = (a + MOD) % MOD;
        b = (b + MOD) % MOD;
        ll au = a >> 31;
        ll ad = a & MASK31;
        ll bu = b >> 31;
        ll bd = b & MASK31;
        ll mid = ad * bu + au * bd;
        ll midu = mid >> 30;
        ll midd = mid & MASK30;
        return CalcMod(au * bu * 2 + midu + (midd << 31) + ad * bd);
    }

    //mod 2^61-1を計算する関数
    ll CalcMod(ll x)
    {
        ll xu = x >> 61;
        ll xd = x & MASK61;
        ll res = xu + xd;
        if (res >= MOD) res -= MOD;
        return res;
    }

    ll PowMod(ll base, ll exp) { // base^exp mod MOD
        if (exp == 0) {
            return 1;
        } else if (exp % 2 == 0) {
            ll t = PowMod(base, exp / 2);
            return Mul(t, t);
        } else {
            return Mul(base, PowMod(base, exp - 1));
        }
    }

    ll GetHash(string s){ // 文字列sのhashを取得
        ll now = 0;
        int n = sz(s);
        rrep(i,n){
            now = Mul(now,Base) + CharHash[s[i]];
        }

        return now;
    }

    ll Apply(string s){ // 文字列sにhashを割り当て保存
        ll hash = GetHash(s);
        idx[hash] = str_num;
        str_num++;

        return hash;
    }

    int GetIdx(string s){ // 文字列sの挿入順番号を取得
        ll hash = GetHash(s);

        int ret = -1;

        if (idx.count(hash)) ret = idx[hash];

        return ret;
    }

    int GetIdx(ll hash){ // hashをもつ文字列のidxを取得
        int ret = -1;

        if (idx.count(hash)) ret = idx[hash];

        return ret;
    }
}rhash;

//RollingHash stringにmod(2^61-1)の整数を割り当てる

void solve(){
    int n; cin>>n;

    vb ans(n);

    rep(i,n){
        string s; cin>>s;

        ll hash = rhash.GetHash(s);
        
        bool ok = false;

        if (rhash.GetIdx(hash) != -1) ok = true;

        rep(i,sz(s)-1){
            ll ch = rhash.CharHash[s[i]];
            ll ch2 = rhash.CharHash[s[i+1]];

            ll base = rhash.Base;

            ll tmp = rhash.Mul(base,ch) + ch2 - ch - rhash.Mul(base,ch2);
            tmp = rhash.Mul(tmp , rhash.PowMod(base , i));
            tmp += hash;
            tmp %= rhash.MOD;

            if (rhash.GetIdx(tmp) != -1) ok = true;
        }

        ans[i] = ok;

        rhash.Apply(s);
    }

    fore(y , ans){
        cout << (y ? "Yes" : "No") << endl;
    }
    

    return;
}

int main(){

    solve();

    return 0;
}

yukicoder

結果

テストケース

ソースコード