Codeforces Round 832 (Div. 2) C - Swap Game

无聊补题时发现与题解不一样的思路,感觉有点神奇OWO

#include<iostream>
#include<sstream>
#include <cstdio>
#include<stack>
#include<vector>
#include<list>
#include<iomanip>
#include<cstring>
#include<cmath>
#include<queue>
#include<algorithm>
#include<utility>
#include<cctype>
#include<cstdio>
#include<map>
#include<set>
#include<bitset>
#include <utility>
#define int long long
using namespace std;
const int mod = 998244353;
int a[300050];
void solve()
{
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;
		if (i == 0)a[i] = x * 2 - 1;
		else a[i] = x * 2;
	}
	sort(a, a + n);
	if (a[0] % 2 == 0)cout << "Alice" << endl;
	else cout << "Bob" << endl;
}
signed main() {
    ios::sync_with_stdio(0); cin.tie(0), cout.tie(0);
    int t;
	cin >> t;
	while (t--) {
		solve();
	}
    return 0;
}