Submission #30247609

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define rrep(i, a, b) for (int i = (a); i >= (b); --i)
#define PB push_back
#define ar2 array<int, 2>
typedef long long LL;
// typedef __int128 LLL;
const LL P = 998244353;
const int INF = 1e5 + 5;
const int N = 3e5 + 5;
mt19937 rng(time(0));

int n, a[N];
bool f[1 << 20];

int main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    cin >> n;
    a[0] = -1;
    rep(i, 1, n) cin >> a[i];

    /*int ma = 10;
    rep(mask, 1, (1 << ma) - 1) {
        if (mask + 1 & -(mask + 1))
            f[mask] = true;

        int k = 0;
        while (mask >= (1 << k))
            k++;
        k--;
        f[mask] = true;
        rep(j, 0, k - 1) if (!(mask >> j & 1)) {
            int mask1 = mask - (1 << k) + (1 << j);
            if (f[mask1])
                f[mask] = false;
        }

        if (f[mask]) {
            rep(j, 0, ma - 1) if (mask >> j & 1) cerr << j << " ";
            cerr << endl;
        }
    }*/

    cout << (a[n - 1] == a[n] - 1 && n % 2 == a[n - 1] % 2 ? "Bob" : "Alice");
    return 0;
}

Submission Info

Judge Result