Submission #3273618


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

long long n, l;
const int dsize = 2;
long long calc(long long x) {
  if(x == 0) return 0;
  if(x % 2 == 1) return 1;
  long long now = 63;
  while(now--) {
    if(x % (1 << now) == 0) return now;
  }
  return 0;
}
struct Trie {
  struct data {
    int num;
    data *child[dsize];
    data(int nnum = -1) {
      num = nnum;
      fill(child, child + dsize, (data *)0);
    }
  };
  data root;
  Trie() { root = data(0); }
  void make(string x) {
    data *now = &root;
    for(int i = 0; i < x.size(); ++i) {
      if(!now->child[x[i] - '0'])
        now->child[x[i] - '0'] = new data(now->num + 1);
      now = now->child[x[i] - '0'];
    }
  }
  bool solve() {
    long long ans = 0;
    if(root.child[0]) ans ^= recall(root.child[0]);
    if(root.child[1]) ans ^= recall(root.child[1]);
    if((!root.child[0]) || (!root.child[1])) ans ^= calc(l);
    return ans == 0;
  }
  long long recall(data *now) {
    long long ans = 0;
    if((!now->child[0]) && (!now->child[1])) return 0;
    if((!now->child[0]) || (!now->child[1]))
      ans = calc(l - now->num);
    if(now->child[0]) ans ^= recall(now->child[0]);
    if(now->child[1]) ans ^= recall(now->child[1]);
    return ans;
  }
};
void prians(bool answer) {
  if(answer)
    cout << "Bob" << endl;
  else
    cout << "Alice" << endl;
}
Trie trie;
int main() {
  cin >> n >> l;
  for(int i = 0; i < n; ++i) {
    string s;
    cin >> s;
    trie.make(s);
  }
  prians(trie.solve());
  return 0;
}

Submission Info

Submission Time
Task E - Prefix-free Game
User m_tsubasa
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1568 Byte
Status
Exec Time 27 ms
Memory 5632 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 0_05.txt
All 700 / 700 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 1 ms 256 KB
0_01.txt 1 ms 256 KB
0_02.txt 1 ms 256 KB
0_03.txt 1 ms 256 KB
0_04.txt 1 ms 256 KB
0_05.txt 1 ms 256 KB
1_00.txt 1 ms 256 KB
1_01.txt 1 ms 256 KB
1_02.txt 1 ms 256 KB
1_03.txt 1 ms 256 KB
1_04.txt 1 ms 256 KB
1_05.txt 1 ms 256 KB
1_06.txt 27 ms 5632 KB
1_07.txt 26 ms 4480 KB
1_08.txt 15 ms 2944 KB
1_09.txt 26 ms 4480 KB
1_10.txt 26 ms 4480 KB
1_11.txt 5 ms 512 KB
1_12.txt 5 ms 256 KB
1_13.txt 5 ms 256 KB
1_14.txt 10 ms 768 KB
1_15.txt 9 ms 768 KB
1_16.txt 10 ms 768 KB
1_17.txt 10 ms 768 KB
1_18.txt 10 ms 768 KB
1_19.txt 10 ms 768 KB
1_20.txt 10 ms 768 KB
1_21.txt 10 ms 768 KB
1_22.txt 10 ms 768 KB
1_23.txt 10 ms 768 KB
1_24.txt 9 ms 768 KB
1_25.txt 10 ms 768 KB
1_26.txt 10 ms 768 KB
1_27.txt 10 ms 768 KB
1_28.txt 10 ms 768 KB
1_29.txt 10 ms 768 KB
1_30.txt 10 ms 768 KB
1_31.txt 9 ms 768 KB
1_32.txt 9 ms 768 KB
1_33.txt 9 ms 768 KB
1_34.txt 10 ms 768 KB
1_35.txt 10 ms 768 KB
1_36.txt 10 ms 768 KB
1_37.txt 10 ms 768 KB
1_38.txt 10 ms 768 KB
1_39.txt 10 ms 768 KB
1_40.txt 10 ms 768 KB
1_41.txt 10 ms 768 KB
1_42.txt 10 ms 768 KB
1_43.txt 10 ms 768 KB
1_44.txt 10 ms 768 KB
1_45.txt 10 ms 768 KB
1_46.txt 10 ms 768 KB
1_47.txt 10 ms 768 KB
1_48.txt 10 ms 768 KB
1_49.txt 10 ms 768 KB
1_50.txt 10 ms 768 KB
1_51.txt 10 ms 768 KB
1_52.txt 10 ms 768 KB
1_53.txt 10 ms 768 KB