Submission #3017936

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define int long long
using namespace std;

typedef pair<int, int> Pii;

template<typename T>
void readvec(vector<T> &a);
void readindex(vector<int> &a);



signed main(){

    int N, L;
    cin >> N >> L;

    vector<string> S(N);
    REP(i, N){
        cin >> S[i];
    }

    set<string> tree;

    REP(i, N){
        while(S[i].size() >= 0){
            auto r = tree.insert(S[i]);
            S[i].pop_back();
            if(!r.second) break;
        }
    }

    int G = 0;
    for(string t : tree){

        auto it0 = tree.find(t + '0');
        auto it1 = tree.find(t + '1');

        if((it0 == tree.end()) == (it1 == tree.end())) continue;

        int l = L - t.size();
        int g = 1;
        while(l % 2 == 0){
            g = g << 1;
            l = l >> 1;
        }
        G ^= g;
    }

    if(G != 0){
        cout << "Alice";
    }else{
        cout << "Bob";
    }
    
    return 0;
}


template<typename T>
void readvec(vector<T> &a){
    REP(i, a.size()){
        cin >> a[i];
    }
}
void readindex(vector<int> &a){
    REP(i, a.size()){
        cin >> a[i];
        a[i]--;
    }
}

Submission Info

Judge Result