提出 #71162736

---

ソースコード 拡げる

/*
  Compete against Yourself.
  Author - Aryan (@aryanc403)
*/
/*
  Credits -
  Atcoder library - https://atcoder.github.io/ac-library/production/document_en/ (namespace atcoder)
  Github source code of library - https://github.com/atcoder/ac-library/tree/master/atcoder
  https://codeforces.com/contest/4/submission/150120627
*/
#include <atcoder/string>
#include <atcoder/segtree>

#ifdef ARYANC403
    #include <header.h>
#else
    #pragma GCC optimize ("Ofast")
    // #pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
    #pragma GCC target ("sse,sse2,mmx")
    #pragma GCC optimize ("-ffloat-store")
    #include <bits/stdc++.h>
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
    #define dbg(args...) 42;
    #define endl "\n"
#endif

// y_combinator from @neal template https://codeforces.com/contest/1553/submission/123849801
// http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0200r0.html
template<class Fun> class y_combinator_result {
    Fun fun_;
public:
    template<class T> explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}
    template<class ...Args> decltype(auto) operator()(Args &&...args) { return fun_(std::ref(*this), std::forward<Args>(args)...); }
};
template<class Fun> decltype(auto) y_combinator(Fun &&fun) { return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun)); }

using namespace std;
#define fo(i,n)   for(i=0;i<(n);++i)
#define repA(i,j,n)   for(i=(j);i<=(n);++i)
#define repD(i,j,n)   for(i=(j);i>=(n);--i)
#define all(x) begin(x), end(x)
#define sz(x) ((lli)(x).size())
#define eb emplace_back
#define X first
#define Y second

using lli = long long int;
using mytype = long double;
using ii = pair<lli,lli>;
using vii = vector<ii>;
using vi = vector<lli>;

template <class T>
using ordered_set =  __gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
// X.find_by_order(k) return kth element. 0 indexed.
// X.order_of_key(k) returns count of elements strictly less than k.

// namespace Re = std::ranges;
// namespace Ve = std::ranges::views;

const auto start_time = std::chrono::high_resolution_clock::now();
void aryanc403()
{
auto end_time = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> diff = end_time-start_time;
    cerr<<"Time Taken : "<<diff.count()<<"\n";
}

const lli INF = 1e7;
const lli SEED=chrono::steady_clock::now().time_since_epoch().count();
mt19937_64 rng(SEED);
inline lli rnd(lli l=0,lli r=INF)
{return uniform_int_distribution<lli>(l,r)(rng);}

class CMP
{public:
bool operator()(ii a , ii b) //For min priority_queue .
{    return ! ( a.X < b.X || ( a.X==b.X && a.Y <= b.Y ));   }};

void add( map<lli,lli> &m, lli x,lli cnt=1)
{
    auto jt=m.find(x);
    if(jt==m.end())         m.insert({x,cnt});
    else                    jt->Y+=cnt;
}

void del( map<lli,lli> &m, lli x,lli cnt=1)
{
    auto jt=m.find(x);
    if(jt->Y<=cnt)            m.erase(jt);
    else                      jt->Y-=cnt;
}

bool cmp(const ii &a,const ii &b)
{
    return a.X<b.X||(a.X==b.X&&a.Y<b.Y);
}


int OP(int a, int b) { return min(a, b); }
int E() { return INF; }

bool solve(string &s){
    const lli n=sz(s);
    const auto sa = atcoder::suffix_array(s);
    const auto lcp = atcoder::lcp_array(s, sa);
    atcoder::segtree<int, OP, E> seg(lcp);
    map<lli,bool> dp;
    // dbg(s);
    // for(const auto &i:sa){
    //     dbg(s.substr(i));
    // }
    auto re=y_combinator([&](const auto &self,const lli L,const lli R,const bool f)->bool{
        // dbg(L,R,f);
        if(L>R)
            return !f;
        if(L==R){
            const lli len = n-sa[L];
            // dbg(L,sa[L],len,f,(len+f)&1);
            return (len+f)&1;
        }
        auto isSuf=[&](const lli i,const lli l)->lli{
            return sa[i]+l==n;
        };
        const lli key = L*n*2+R*2+f;
        if(dp.count(key))
            return dp[key];
        const lli len = seg.prod(L,R);
        // dbg(L,R,len);
        auto getNext=[&](const lli i,const char c)->lli{
            auto chk=[&](const lli j)->bool{
                if(j>=n)
                    return false;
                const lli p=sa[j];
                assert(p+len<n);
                if(s[p+len]>c)
                    return false;
                // if(p+len<n&&s[p+len]>c)
                //     return false;
                return true;
            };
            if(!chk(i))
                return i;
            lli l=i,r=R+1;
            while(r-l>1){
                const lli m=(l+r)/2;
                if(chk(m))
                    l=m;
                else
                    r=m;
            }
            return r;
        };

        lli i=L;
        if(isSuf(i,len))
            i++;
        const lli nxt = (len+1)&1;
        // dbg(L,R,nxt,i);
        for(char c='a';c<='z';c++){
            const lli j=getNext(i,c);
            // if(L==0&&R==3){
            //     dbg(L,R,i,j,c);
            // }
            if(i==j)
                continue;
            const auto res=self(i,j-1,nxt);
            // dbg(f,nxt,L,R,c,i,j-1,res);
            if(!res)
                return dp[key]=true;
            i=j;
        }
        return dp[key]=false;
    });

    return re(0,n-1,0);
}

int main(void) {
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // freopen("txt.in", "r", stdin);
    // freopen("txt.out", "w", stdout);
// cout<<std::fixed<<std::setprecision(35);
// Ve::iota(1, 6) | Ve::transform([](int x) { return x * 2; }) | Ve::reverse | Ve::take(3)
lli T=1;
cin>>T;
while(T--)
{
    string s;
    cin>>s;
    const auto res=solve(s);
    cout<<(res?"Alice":"Bob")<<endl;
}   aryanc403();
    return 0;
}

提出情報

ジャッジ結果