Submission #44111625

---

Source Code Expand

// WEBLINK

#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <queue>

using namespace std;

using ll = long long;
using ii = pair<int, int>;
using iii = pair<ii, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vii = vector<ii>;

#define pb push_back
#define fst first
#define snd second
#define all(x) (x).begin,(x).end()
#define rall(x) (x).rbegin,(x).rend()

// ------------- SORT -------------------

template<class T> void Sort(vector<T> & a) { sort(a.begin(), a.end()); }
template<class T> void Rsort(vector<T> & a) { sort(a.rbegin(), a.rend()); }

// ------------- INPUT -------------------

template<class T> void inp(T & x) { cin >> x; }
template<class T> void inp(vector<T> & t) { for (auto && x : t) cin >> x; }

// ---------- MOD --------------------
const int mod = 1000000007;

void add(int & x, int y) {
	x += y;
	if (x < 0) x += mod;
	if (x >= mod) x -= mod;
}
int add2(int x, int y) {
	x += y;
	if (x < 0) x += mod;
	if (x >= mod) x -= mod;
	return x;
}

int mul(int x, int y) {ll r = x; r *= y; return r % mod;}

int power(int x, int p) {
	if (x < 0 or p < 0) return 0;
	int r = 1;
	while (p > 0)
	{
		if (p & 1) r = mul(r, x);
		x = mul(x, x); p /= 2;
	} return r;
}
int inv(int a) { return power(a, mod - 2); }

// ------------- MINMAX -------------------

template<typename T, typename T1>T amax(T &a, T1 b) {if (b > a)a = b; return a;}
template<typename T, typename T1>T amin(T &a, T1 b) {if (b < a)a = b; return a;}

// ---------- DEBUG --------------------

//#define ON_PC
#ifdef ON_PC
#include </Users/karanaggarwal/code/debug.h>
#else
#define deb(x...)
#endif

///////////////////////////////////

int get(queue<int> & q)
{
	if (q.empty()) return 1000000000;
	return q.front();
}

void solve()
{
	int n;
	string s;
	cin >> n >> s;
	queue<int> A, B;
	for (int i = 0; i <= n; i++)
		if (s[i] == 'A')
			A.push(i);
		else
			B.push(i);
	for (int k = 0; k < n; k++)
	{
		if (k % 2 == 0 and !B.empty())
			B.pop();
		if (k % 2 == 1 and !A.empty())
			A.pop();
		if (get(A) < get(B)) cout << "Alice" << endl;
		else cout << "Bob" << endl;
	}
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int t = 1;
	// cin >> t;
	while (t--)
	{
		solve();
	}

	return 0;
}

Submission Info

Judge Result