hdu 5389 Zero Escape（记忆化搜索）

Problem Description

Zero Escape, is a visual novel adventure video game directed by Kotaro Uchikoshi (you may hear about ever17?) and developed by Chunsoft.

Stilwell is enjoying the first chapter of this series, and in this chapter digital root is an important factor.

This is the definition of digital root on Wikipedia:
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits, on each iteration using the result from the previous iteration to compute a digit sum. The process continues until a single-digit number is reached.
For example, the digital root of 65536 is 7, because 6+5+5+3+6=25 and 2+5=7.

In the game, every player has a special identifier. Maybe two players have the same identifier, but they are different players. If a group of players want to get into a door numbered X(1≤X≤9), the digital root of their identifier sum must be X.
For example, players {1,2,6} can get into the door 9, but players {2,3,3} can't.

There is two doors, numbered A and B. Maybe A=B, but they are two different door.
And there is n players, everyone must get into one of these two doors. Some players will get into the door A, and others will get into the door B.
For example: 
players are {1,2,6}, A=9, B=1
There is only one way to distribute the players: all players get into the door 9. Because there is no player to get into the door 1, the digital root limit of this door will be ignored.

Given the identifier of every player, please calculate how many kinds of methods are there, mod 258280327.

 

Input

The first line of the input contains a single number T, the number of test cases.
For each test case, the first line contains three integers n, A and B.
Next line contains n integers idi, describing the identifier of every player.
T≤100, n≤105, ∑n≤106, 1≤A,B,idi≤9

 

Output

For each test case, output a single integer in a single line, the number of ways that these n players can get into these two doors.

 

Sample Input

4
3 9 1
1 2 6
3 9 1
2 3 3
5 2 3
1 1 1 1 1
9 9 9
1 2 3 4 5 6 7 8 9

 

Sample Output

1
0
10
60

 

Source

2015 Multi-University Training Contest 8

 

首先注意到求数根的方法，其实将要求数根的这个数%9就可以轻松得到，只是一开始的时候要把A或B等于9改为0，这样就可以轻松求出数根了。

题目要求将每个数放入A或B，那么不妨将所有的方法都找出来，即每个数不是放入A就是放入B。

这道题用传统的dfs肯定会超时，所以用一个dp数组来记录状态，采用记忆化搜索来大大缩短运行时间，具体看代码

 

 

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 using namespace std;
 #pragma comment(linker, "/STACK:1024000000,1024000000")
 #define N 100006
 #define M 16
 #define MOD 258280327
 int n,A,B;
 int dp[N][M];
 int a[N];
 int sum;
 int dfs(int cur,int suma,int now)
 {
     if(dp[cur][suma]!=-) return dp[cur][suma];
     if(cur>n)
     {
         if(now==)
         {
             return (sum-now)%==B;
         }
         if(now==sum)
         {
             return suma == A;
         }
         return suma==A && (sum-now)%==B;
     }

     dp[cur][suma]=dfs(cur+,(suma+a[cur])%,now+a[cur])+dfs(cur+,suma,now);
     return dp[cur][suma]%=MOD;
 }
 int main()
 {
     int t;
     scanf("%d",&t);
     while(t--)
     {
         scanf("%d%d%d",&n,&A,&B);
         if(A==)
          A=;
         if(B==)
           B=;
         sum=;
         for(int i=;i<=n;i++)
         {
             scanf("%d",&a[i]);
             sum+=a[i];
         }  

         memset(dp,-,sizeof(dp));
         printf("%d\n",dfs(,,));
     }
     return ;
 }