题解 | 浮木博弈

#include <bits/stdc++.h>
using namespace std;
int t, n, a[100005];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> t;
    while (t--) {
        cin >> n;
        int cnt = 0;
        bool f = 0;
        for (int i = 1; i <= n; i++) {
            cin >> a[i];
            if (a[i] != 1) {
                f = 1;
            }
            if (!f && i != n) {
                cnt++;
            }
        }
        cout << (cnt & 1 ? "Bob\n" : "Alice\n");
    }
    return 0;
}