题解 | 浮木博弈

/*
	这一发终于过了，只花了114514h.
*/
#include<iostream>
#include<cstring>
#include<algorithm>
#include<chrono>
#include<random>
#include<unordered_map>
#include<vector>
#include<cmath>
using namespace std;
#define int long long
#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define MAXN 2000010
#define debug cout<<"&"<<"\n"
//陪伴我一生的随机数呀 
std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    std::uniform_int_distribution<int> distribution(l, r);
    return distribution(rng);
}
int a[MAXN];
bool solve(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    if(n==1)return true;
    for(int i=1;i<=n;i++)
    if(a[i]>1){
        if(i&1)return true;
        return false;
    }
    if(n&1)return true;
    return false;
}

signed main(){
	ios;
	int t=1;
	cin>>t;
	while(t--)
	if(solve())cout<<"Alice"<<"\n";
    else cout<<"Bob"<<"\n";
	return 0;
}