提出 #1879679

---

ソースコード 拡げる

#include <bits/stdc++.h>

typedef long long ll;
using namespace std;

struct node{
	node *nxt[2];
	bool end;
	node(){
		nxt[0] = nxt[1] = 0;
		end = 0;
	}
};

node *root;
void ins(string &s){
	node *cur = root;
	for(int i = 0; i < s.size(); i++){
		if(!cur->nxt[s[i] - '0'])
			cur->nxt[s[i] - '0'] = new node();
		cur = cur->nxt[s[i] - '0'];
	}
	cur->end = 1;
}

ll l;
int al, b;
int get(node *cur, int d = 0){
	if(cur->end)
		return 0;
	int ret = 0;
	if(cur->nxt[0])
		ret += get(cur->nxt[0], d + 1);
	else if((l - (d + 1)) % 2) al++;
	else if(d + 1 == l) ret++;
	else b++;
	if(cur->nxt[1])
		ret += get(cur->nxt[1], d + 1);
	else if((l - (d + 1)) % 2) al++;
	else if(d + 1 == l) ret++;
	else b++;
	return ret;
}

int main(){
	ios_base::sync_with_stdio(0);
	//	srand(time(NULL));
	ll n; while(cin >> n >> l){
	root = new node();
	while(n--){
		string s; cin >> s;
		ins(s);
	}
	al = b = 0;
	int tmp = get(root);
	if(al % 2 || !al && (tmp + b) % 2)
		cout << "Alice\n";
	else cout << "Bob\n";
	}
	return 0;
}

提出情報

ジャッジ結果