Codeforces Round #297 (Div. 2) [ 折半 + 三进制状压 + map ]

传送门

E. Anya and Cubes

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Anya loves to fold and stick. Today she decided to do just that.

Anya has n cubes lying in a line and numbered from 1 to n from left to right, with natural numbers written on them. She also has k stickers with exclamation marks. We know that the number of stickers does not exceed the number of cubes.

Anya can stick an exclamation mark on the cube and get the factorial of the number written on the cube. For example, if a cube reads 5, then after the sticking it reads 5!, which equals 120.

You need to help Anya count how many ways there are to choose some of the cubes and stick on some of the chosen cubes at most k exclamation marks so that the sum of the numbers written on the chosen cubes after the sticking becomes equal to S. Anya can stick at most one exclamation mark on each cube. Can you do it?

Two ways are considered the same if they have the same set of chosen cubes and the same set of cubes with exclamation marks.

Input

The first line of the input contains three space-separated integers n, k and S (1 ≤ n ≤ 25, 0 ≤ k ≤ n, 1 ≤ S ≤ 10¹⁶) — the number of cubes and the number of stickers that Anya has, and the sum that she needs to get.

The second line contains n positive integers a_i (1 ≤ a_i ≤ 10⁹) — the numbers, written on the cubes. The cubes in the input are described in the order from left to right, starting from the first one.

Multiple cubes can contain the same numbers.

Output

Output the number of ways to choose some number of cubes and stick exclamation marks on some of them so that the sum of the numbers became equal to the given number S.

Sample test(s)

Input

2 2 30
4 3

Output

1

Input

2 2 7
4 3

Output

1

Input

3 1 1
1 1 1

Output

6

Note

In the first sample the only way is to choose both cubes and stick an exclamation mark on each of them.

In the second sample the only way is to choose both cubes but don't stick an exclamation mark on any of them.

In the third sample it is possible to choose any of the cubes in three ways, and also we may choose to stick or not to stick the exclamation mark on it. So, the total number of ways is six.

tag：

binary search

brute force

hashing

meet-in-the-middle

转一下官方题解：

http://codeforces.ru/blog/entry/17119?locale=en

525E — Anya and Cubes

To solve this problem we need to use meet-in-the-middle. At first sort given array in increasing order and divide it in two parts. In first part must be first n / 2 elements, in second part — other.

Iterate all submasks of all masks of elements from first part. That is iterate which cubes from first part we take and on which from them we paste exclamation marks. In this way we iterated all possible sums, which we can get with cubes from first part. Let for current submask we get sum sum_lf and use t_lf exclamation marks. To store all such sums we use associative arrays map < long long > cnt[k + 1], where k — count of exclamation marks which we have in the beginning.

After that similary iterate all submasks of all masks of elements from second part. Let for current submask sum is sum_rg and number of used exclamation marks is t_rg. Then from first part we need to get sum (s - sum_rg) and we can use only (k - t_rg) exclamation marks, where s — sum which we must get by condition of the problem. Then iterate how many exclamation marks we will use in first part (let it be variable cur) and increase answer on cnt[cur][s - sum_rg]. To accelerate our programm we may increase answer only if cnt[cur].count(s - sum_rg) = true.

For submasks in iterate we can cut off iteration on current sum for submask (it must be less or equal to given s) and on current count of exclamation marks (it must be less or equal to given k). Also we should not paste exclamation marks on cubecs with numbers larger than 18, because 19! more than 10¹⁶ — maximal value of s.

Asymptotic behavior of this solution — O(3^{((n + 1) / 2)} * log(maxcnt) * k), where n — count of cubes, maxcnt — maximal size of associative array, k — count of exclamation marks.

题意：选一些数，某些可以是该数的阶乘（不超过k个），问和等于S的方案数

题解：折半，三进制状压（0表示不选，1表示选ai，2表示选ai!)，map

加速： To accelerate our programm we may increase answer only if cnt[cur].count(s - sum_rg) = true.

不加速会T，，T在test91

10487086	2015-03-27 13:58:06	njczy2010	E - Anya and Cubes	GNU C++	Time limit exceeded on test 91	2000 ms	33200 KB
10487048	2015-03-27 13:54:28	njczy2010	E - Anya and Cubes	GNU C++	Accepted	858 ms	3800 KB

 #include <cstdio>
 #include <cstring>
 #include <stack>
 #include <vector>
 #include <map>
 #include <algorithm>

 #define ll long long
 int const N = ;
 int const M = ;
 int const inf = ;
 ll const mod = ;

 using namespace std;

 int n,k;
 ll s;
 ll ans;
 ll a[N];
 ll f[N];
 map<ll,ll> cnt[N];
 int L,R;
 int totL,totR;
 int b[N];

 void ini1()
 {
     ll i;
     f[]=;
     for(i=;i<=;i++){
         f[i]=f[i-]*i;
     }
 }

 int pw(int x)
 {
     int re=;
     for(int i=;i<=x;i++){
         re*=;
     }
     return re;
 }

 void ini()
 {
     int i;
     ans=;
     for(i=;i<n;i++){
         scanf("%I64d",&a[i]);
     }
     for(i=;i<=k;i++){
         cnt[i].clear();
     }
     L=n/;
     totL=pw(L);
     R=n-L;
     totR=pw(R);
 }

 void solve()
 {
     int o,j;
     int te;
     ll sum;
     int cou;
     int ff;
     for(o=;o<totL;o++){
         te=o;
         for(j=;j<L;j++){
             b[j]=te%;
             te/=;
         }
         sum=;cou=;
         ff=;
         for(j=;j<L;j++){
             if(b[j]==) continue;
             else if(b[j]==){
                 sum+=a[j];
             }
             else{
                 if(a[j]>=){
                     ff=;break;
                 }
                 else{
                     sum+=f[ a[j] ];
                     cou++;
                 }
             }
             if(sum>s){
                 ff=;break;
             }
         }
         if(ff== || sum>s) continue;
         cnt[ cou ][ sum ]++;
     }

     for(o=;o<totR;o++){
         te=o;
         for(j=;j<R;j++){
             b[j]=te%;
             te/=;
         }
         sum=;cou=;
         ff=;
         for(j=;j<R;j++){
             if(b[j]==) continue;
             else if(b[j]==){
                 sum+=a[j+L];
             }
             else{
                 if(a[j+L]>=){
                     ff=;break;
                 }
                 else{
                     sum+=f[ a[j+L] ];
                     cou++;
                 }
             }
             if(sum>s){
                 ff=;break;
             }
         }
         if(ff==) continue;
         int leftk=k-cou;
         ll lefts=s-sum;
         if(leftk<) continue;
         if(lefts<) continue;
         for(int x=;x<=leftk;x++){
             //printf(" x=%d lefts=%I64d cnt=%d\n",x,lefts,cnt[x][lefts]);
             if(cnt[x].count(lefts)>)
             ans+=cnt[ x ][ lefts ];
         }

     }
 }

 void out()
 {
     printf("%I64d\n",ans);
 }

 int main()
 {
     ini1();
     //freopen("data.in","r",stdin);
    // freopen("data.out","w",stdout);
     //scanf("%d",&T);
     //for(int cnt=1;cnt<=T;cnt++)
     //while(T--)
     while(scanf("%d%d%I64d",&n,&k,&s)!=EOF)
     {
         ini();
         solve();
         out();
     }
 }