XTOJ 1168 Alice and Bob （记忆化搜索）

#define gril 0
#define boy 1

using namespace std;
const int inf = 100000000;
int A[20] , B[20];
int dp[10002][2];

bool Find(int n , int who)
{
if(who == gril)
{
for(int i = 0;i <= 14;i++)
if(n == A[i]) return true;
return false;
}
if(who == boy)
{
for(int i = 0;i <= 9;i++)
if(n == B[i]) return true;
return false;
}
}

int dfs(int n , int who)
{
if(dp
[who] != inf) return dp
[who];//已经计算过，直接返回
if(who == gril)//判断此轮为男生还是女生，若为女生
{
if(Find(n , gril))
return dp
[gril] = 1;
else
{
for(int i = 0;n - A[i] >=0 ;i++)
dp
[gril] = Min(dp
[gril] , dfs(n - A[i] , boy) + 1);
return dp
[gril];
}
}
if(who == boy)//若为男生
{
if(Find(n , boy))
return dp
[boy] = 1;
else
{
for(int i = 0;n - B[i] >= 0;i++)
dp
[boy] = Min(dp
[boy] , dfs(n - B[i] , gril) + 1);
return dp
[boy];
}

}
}

int main()
{
int i , j ;
j = 1;
A[0] = j;
for(i = 1;i <= 14;i++)
{
j *= 2;
A[i] = j;
}
j = 1;
B[0] = j;
for(i = 1;i <= 9;i++)
{
j *= 3;
B[i] = j;
}
int t;
scanf("%d",&t);
while(t--)
{
for(int i = 0;i < 10002;i++)
for(int j = 0;j < 2;j++)
dp[i][j] = inf;
int n;
scanf("%d",&n);
int ans = dfs(n , gril);
printf("%d\n",ans);
}
return 0;
}