Poker Game: Decision（DFS剪枝博弈）

题目来源：

蔚来杯"2022牛客暑期多校训练营8
 

Poker Game: Decision
 

大致题意：

最初A2张牌 B2张牌

从A开始轮流从6个牌中挑选1张牌 拿3轮

AB都能看到所有的牌 包括初始的2张和可以选的6张 AB都会采取最优策略挑选牌

之后A5张牌 B5张牌 比较A的牌和B的牌哪个好 或者同样好

（判定好坏规则在题面中）

大致思路：

DFS剪枝判定每次选牌的最终状态

边界情况用pair类型模拟处理

AC代码：

#include <bits/stdc++.h>
using namespace std;
using db = double;
using ll = long long;
#define edl '\n'
#define str string
#define pll pair<ll, ll>
#define fir first
#define sec second
#define heap priority_queue
#define SPO(n) fixed << setprecision(n)
#define FOR(i, l, r) for (long long i = l; i <= r; ++i)
#define ROF(i, r, l) for (long long i = r; i >= l; --i)
#ifdef debugcmd
#define DBG(n) cout << "!!! " << #n << ": " << n << edl
#else
#define DBG(n) ;
#endif
// const double PI = acos(-1.0);
// const double EPS = 1.0e-9;
const long long LNF = 0x3f3f3f3f3f3f3f3fLL;
const int INF = 0x3f3f3f3f;
const long long MOD = 1e9 + 7;
const int MXN = 1e5 + 5;
str a[10];
str b[10];
str c[10];
bool vis[10];
map<ll, ll> cntA;
map<ll, ll> cntB;
vector<pll> va;
vector<pll> vb;

ll GetNum(char ch)
{
	if ('2' <= ch && ch <= '9')
		return ch - '0';
	if (ch == 'T')
		return 10;
	if (ch == 'J')
		return 11;
	if (ch == 'Q')
		return 12;
	if (ch == 'K')
		return 13;
	if (ch == 'A')
		return 14;
	return -1;
}
bool CMP(pll u, pll v)
{
	if (u.sec != v.sec)
		return u.sec > v.sec;
	return u.fir > v.fir;
}
ll GetARank(void)
{
	ll n = va.size();
	bool same = true;
	FOR(i, 1, 4)
	if (a[i][1] != a[i + 1][1])
	{
		same = false;
		break;
	}
	bool ctn = true;
	bool boom = false;
	if (n != 5)
		ctn = false;
	else
	{
		FOR(i, 0, n - 2)
		if (va[i].fir != va[i + 1].fir + 1)
		{
			ctn = false;
			break;
		}
		if (ctn && va[0].fir == 14)
			boom = true;
		if (ctn == false)
		{
			if (va[0].fir == 14 &&
				va[1].fir == 5 &&
				va[2].fir == 4 &&
				va[3].fir == 3 &&
				va[4].fir == 2)
			{
				ctn = true;
				va[0].fir = 5;
				va[1].fir = 4;
				va[2].fir = 3;
				va[3].fir = 2;
				va[4].fir = 1;
			}
		}
	}
	if (boom && same)
		return 10;
	if (same && ctn)
		return 9;
	if (va[0].sec == 4)
		return 8;
	if (va[0].sec == 3 && va[1].sec == 2)
		return 7;
	if (same)
		return 6;
	if (ctn)
		return 5;
	if (va[0].sec == 3)
		return 4;
	if (va[0].sec == 2 && va[1].sec == 2)
		return 3;
	if (va[0].sec == 2)
		return 2;
	return 1;
}
ll GetBRank(void)
{
	ll n = vb.size();
	bool same = true;
	FOR(i, 1, 4)
	if (b[i][1] != b[i + 1][1])
	{
		same = false;
		break;
	}
	bool ctn = true;
	bool boom = false;
	if (n != 5)
		ctn = false;
	else
	{
		FOR(i, 0, n - 2)
		if (vb[i].fir != vb[i + 1].fir + 1)
		{
			ctn = false;
			break;
		}
		if (ctn && vb[0].fir == 14)
			boom = true;
		if (ctn == false)
		{
			if (vb[0].fir == 14 &&
				vb[1].fir == 5 &&
				vb[2].fir == 4 &&
				vb[3].fir == 3 &&
				vb[4].fir == 2)
			{
				ctn = true;
				vb[0].fir = 5;
				vb[1].fir = 4;
				vb[2].fir = 3;
				vb[3].fir = 2;
				vb[4].fir = 1;
			}
		}
	}
	if (boom && same)
		return 10;
	if (same && ctn)
		return 9;
	if (vb[0].sec == 4)
		return 8;
	if (vb[0].sec == 3 && vb[1].sec == 2)
		return 7;
	if (same)
		return 6;
	if (ctn)
		return 5;
	if (vb[0].sec == 3)
		return 4;
	if (vb[0].sec == 2 && vb[1].sec == 2)
		return 3;
	if (vb[0].sec == 2)
		return 2;
	return 1;
}
ll Check(void)
{
	cntA.clear();
	cntB.clear();
	va.clear();
	vb.clear();
	FOR(i, 1, 5)
	{
		++cntA[GetNum(a[i][0])];
		++cntB[GetNum(b[i][0])];
	}
	for (auto it : cntA)
		va.push_back(it);
	for (auto it : cntB)
		vb.push_back(it);
	sort(va.begin(), va.end(), CMP);
	sort(vb.begin(), vb.end(), CMP);
	ll ARank = GetARank();
	ll BRank = GetBRank();
	if (ARank > BRank)
		return 1;
	if (BRank > ARank)
		return 2;
	if (ARank == 10)
		return 3;
	ll n = va.size();
	FOR(i, 0, n - 1)
	{
		if (va[i].fir == vb[i].fir)
			continue;
		if (va[i].fir > vb[i].fir)
			return 1;
		if (vb[i].fir > va[i].fir)
			return 2;
	}
	return 3;
}
ll DFS(ll step)
{
	if (step == 7)
		return Check();
	ll f[5];
	FOR(i, 1, 3)
	f[i] = 0;
	if (step & 1)
	{
		FOR(i, 1, 6)
		{
			if (vis[i] == false)
			{
				a[3 + step / 2] = c[i];
				vis[i] = true;
				ll res = DFS(step + 1);
				++f[res];
				vis[i] = false;
				if (res == 1)
					break;
			}
		}
	}
	else
	{
		FOR(i, 1, 6)
		{
			if (vis[i] == false)
			{
				b[2 + step / 2] = c[i];
				vis[i] = true;
				ll res = DFS(step + 1);
				++f[res];
				vis[i] = false;
				if (res == 2)
					break;
			}
		}
	}
	if (step & 1)
	{
		if (f[1] > 0)
			return 1;
		if (f[3] > 0)
			return 3;
		return 2;
	}
	else
	{
		if (f[2] > 0)
			return 2;
		if (f[3] > 0)
			return 3;
		return 1;
	}
	return -1;
}
void Solve(void)
{
	FOR(i, 1, 2)
	cin >> a[i];
	FOR(i, 1, 2)
	cin >> b[i];
	FOR(i, 1, 6)
	{
		cin >> c[i];
		vis[i] = false;
	}
	ll ans = DFS(1);
	if (ans == 1)
		cout << "Alice" << edl;
	else if (ans == 2)
		cout << "Bob" << edl;
	else if (ans == 3)
		cout << "Draw" << edl;
	return;
}
int main(void)
{
	std::ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	// #ifdef cincoutcmd
	// freopen("cin.txt","r",stdin);
	// freopen("cout.txt","w",stdout);
	// #endif
	ll t;
	cin >> t;
	while (t--)
		Solve();
	return 0;
}