結果

問題 No.2102 [Cherry Alpha *] Conditional Reflection
ユーザー woodywoodywoodywoody
提出日時 2022-10-16 03:13:10
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 943 ms / 3,000 ms
コード長 6,245 bytes
コンパイル時間 4,853 ms
コンパイル使用メモリ 255,412 KB
実行使用メモリ 12,824 KB
最終ジャッジ日時 2024-06-27 01:44:56
合計ジャッジ時間 47,141 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 396 ms
7,968 KB
testcase_03 AC 454 ms
8,340 KB
testcase_04 AC 433 ms
7,964 KB
testcase_05 AC 341 ms
5,632 KB
testcase_06 AC 457 ms
7,968 KB
testcase_07 AC 446 ms
5,652 KB
testcase_08 AC 186 ms
5,376 KB
testcase_09 AC 406 ms
8,036 KB
testcase_10 AC 230 ms
5,376 KB
testcase_11 AC 162 ms
5,632 KB
testcase_12 AC 323 ms
6,420 KB
testcase_13 AC 509 ms
8,716 KB
testcase_14 AC 369 ms
6,176 KB
testcase_15 AC 494 ms
8,096 KB
testcase_16 AC 624 ms
9,364 KB
testcase_17 AC 286 ms
5,632 KB
testcase_18 AC 452 ms
6,424 KB
testcase_19 AC 259 ms
5,656 KB
testcase_20 AC 544 ms
8,992 KB
testcase_21 AC 321 ms
5,376 KB
testcase_22 AC 661 ms
9,744 KB
testcase_23 AC 670 ms
9,748 KB
testcase_24 AC 660 ms
9,876 KB
testcase_25 AC 672 ms
9,752 KB
testcase_26 AC 712 ms
9,748 KB
testcase_27 AC 654 ms
9,876 KB
testcase_28 AC 646 ms
9,876 KB
testcase_29 AC 671 ms
9,748 KB
testcase_30 AC 665 ms
9,748 KB
testcase_31 AC 694 ms
9,876 KB
testcase_32 AC 660 ms
9,872 KB
testcase_33 AC 647 ms
9,748 KB
testcase_34 AC 680 ms
9,876 KB
testcase_35 AC 681 ms
9,876 KB
testcase_36 AC 712 ms
9,748 KB
testcase_37 AC 721 ms
9,748 KB
testcase_38 AC 685 ms
9,872 KB
testcase_39 AC 676 ms
9,748 KB
testcase_40 AC 680 ms
9,744 KB
testcase_41 AC 689 ms
9,876 KB
testcase_42 AC 513 ms
8,076 KB
testcase_43 AC 501 ms
8,076 KB
testcase_44 AC 505 ms
8,180 KB
testcase_45 AC 507 ms
8,188 KB
testcase_46 AC 508 ms
8,200 KB
testcase_47 AC 476 ms
6,160 KB
testcase_48 AC 471 ms
6,164 KB
testcase_49 AC 476 ms
6,036 KB
testcase_50 AC 474 ms
6,168 KB
testcase_51 AC 480 ms
6,036 KB
testcase_52 AC 943 ms
6,432 KB
testcase_53 AC 929 ms
6,304 KB
testcase_54 AC 931 ms
6,304 KB
testcase_55 AC 612 ms
5,376 KB
testcase_56 AC 624 ms
5,376 KB
testcase_57 AC 626 ms
5,376 KB
testcase_58 AC 802 ms
5,404 KB
testcase_59 AC 654 ms
12,824 KB
testcase_60 AC 194 ms
5,376 KB
testcase_61 AC 619 ms
5,376 KB
testcase_62 AC 19 ms
5,376 KB
testcase_63 AC 369 ms
5,376 KB
testcase_64 AC 372 ms
5,376 KB
testcase_65 AC 380 ms
5,376 KB
testcase_66 AC 618 ms
5,376 KB
testcase_67 AC 472 ms
5,376 KB
testcase_68 AC 508 ms
5,376 KB
testcase_69 AC 458 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// #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;
    unordered_map<ll,int> idx;
    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){
        ll now = 0;
        int n = sz(s);
        rrep(i,n){
            now = Mul(now,Base) + CharHash[s[i]];
        }

        return now;
    }

    ll Apply(string s){
        ll hash = GetHash(s);
        idx[hash] = str_num;
        str_num++;

        return hash;
    }

    int GetIdx(string s){
        ll hash = GetHash(s);

        int ret = -1;

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

        return ret;
    }

    int GetIdx(ll hash){
        int ret = -1;

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

        return ret;
    }
}rhash;

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;
}
0