Codeforces Round #302 (Div. 2).C. Writing Code (dp)

C. Writing Code

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Programmers working on a large project have just received a task to write exactly m lines of code. There are n programmers working on a project, the i-th of them makes exactly a_i bugs in every line of code that he writes.

Let's call a sequence of non-negative integers v₁, v₂, ..., v_n a plan, if v₁ + v₂ + ... + v_n = m. The programmers follow the plan like that: in the beginning the first programmer writes the first v₁ lines of the given task, then the second programmer writes v₂ more lines of the given task, and so on. In the end, the last programmer writes the remaining lines of the code. Let's call a plan good, if all the written lines of the task contain at most b bugs in total.

Your task is to determine how many distinct good plans are there. As the number of plans can be large, print the remainder of this number modulo given positive integer mod.

Input

The first line contains four integers n, m, b, mod (1 ≤ n, m ≤ 500, 0 ≤ b ≤ 500; 1 ≤ mod ≤ 10⁹ + 7) — the number of programmers, the number of lines of code in the task, the maximum total number of bugs respectively and the modulo you should use when printing the answer.

The next line contains n space-separated integers a₁, a₂, ..., a_n (0 ≤ a_i ≤ 500) — the number of bugs per line for each programmer.

Output

Print a single integer — the answer to the problem modulo mod.

Sample test(s)

input

3 3 3 100 1 1 1

output

10

input

3 6 5 1000000007 1 2 3

output

0

input

3 5 6 11 1 2 1

output

0

 #include<stdio.h>
 #include<string.h>
 const int M =  ;
 int dp[M][M] ;
 int a[M] ;
 int n , m , b , mod ;

 int main ()
 {
    // freopen ("a.txt" , "r" , stdin ) ;
     while (~ scanf ("%d%d%d%d" , &n , &m , &b , &mod )) {
         memset (dp ,  , sizeof(dp)) ;
         for (int i =  ; i < n ; i ++) scanf ("%d" , &a[i]) ;
         int sum =  ;
         memset (dp ,  , sizeof(dp)) ;
         for (int i =  ; i <= m ; i ++) {
             int bug = i * a[] ;
             if (bug <= b) dp[i][bug] =  ;
         }
         for (int i =  ; i < n ; i ++) {
             for (int j =  ; j < m ; j ++) {
                 for (int k =  ; k <= b ; k ++) {
                     if (dp[j][k]) {
                         int x = j +  , y = k + a[i] ;
                         if (y <= b) {
                           //  printf ("(%d , %d) = %d ---> (%d , %d) = %d\n" , j , k , dp[j][k] , x , y , dp[x][y]) ;
                             dp[x][y] += dp[j][k] ;
                             dp[x][y] %= mod ;
                         }
                     }
                 }
             }
         }
         for (int i =  ; i <= b ; i ++) {
             sum += dp[m][i] ;
             sum %= mod ;
         }
         printf ("%d\n" , sum ) ;
     }
 }

记忆化搜索的确很好写，但确实很能爆内存。
学长说一般后一项能由前一项转过来的，用二维就ok了。

还有dp是层与层之间的关系，因为很久没写，又yy成了一层与所有层之间的关系（记忆化搜索）233333