Submission #3017950


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]);
            if(S[i].size() >= 1) 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

Submission Time
Task E - Prefix-free Game
User sumitacchan
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1358 Byte
Status TLE
Exec Time 2182 ms
Memory 1146112 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 6
AC × 55
TLE × 5
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 0_05.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 0_05.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
0_04.txt AC 1 ms 256 KB
0_05.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt TLE 2175 ms 1146112 KB
1_07.txt TLE 2172 ms 1111304 KB
1_08.txt TLE 2177 ms 1109888 KB
1_09.txt TLE 2173 ms 1112832 KB
1_10.txt TLE 2182 ms 1109760 KB
1_11.txt AC 14 ms 1280 KB
1_12.txt AC 6 ms 640 KB
1_13.txt AC 6 ms 640 KB
1_14.txt AC 31 ms 2432 KB
1_15.txt AC 30 ms 2304 KB
1_16.txt AC 31 ms 2432 KB
1_17.txt AC 34 ms 2432 KB
1_18.txt AC 30 ms 2432 KB
1_19.txt AC 30 ms 2432 KB
1_20.txt AC 30 ms 2432 KB
1_21.txt AC 30 ms 2432 KB
1_22.txt AC 31 ms 2432 KB
1_23.txt AC 30 ms 2432 KB
1_24.txt AC 30 ms 2432 KB
1_25.txt AC 31 ms 2432 KB
1_26.txt AC 30 ms 2432 KB
1_27.txt AC 30 ms 2432 KB
1_28.txt AC 30 ms 2432 KB
1_29.txt AC 35 ms 2432 KB
1_30.txt AC 30 ms 2432 KB
1_31.txt AC 30 ms 2432 KB
1_32.txt AC 31 ms 2432 KB
1_33.txt AC 31 ms 2432 KB
1_34.txt AC 30 ms 2432 KB
1_35.txt AC 30 ms 2432 KB
1_36.txt AC 30 ms 2432 KB
1_37.txt AC 30 ms 2432 KB
1_38.txt AC 31 ms 2432 KB
1_39.txt AC 36 ms 2432 KB
1_40.txt AC 30 ms 2432 KB
1_41.txt AC 30 ms 2432 KB
1_42.txt AC 30 ms 2432 KB
1_43.txt AC 31 ms 2432 KB
1_44.txt AC 33 ms 2432 KB
1_45.txt AC 31 ms 2432 KB
1_46.txt AC 30 ms 2432 KB
1_47.txt AC 31 ms 2432 KB
1_48.txt AC 30 ms 2432 KB
1_49.txt AC 30 ms 2432 KB
1_50.txt AC 30 ms 2432 KB
1_51.txt AC 31 ms 2432 KB
1_52.txt AC 30 ms 2432 KB
1_53.txt AC 30 ms 2432 KB