Codeforces 327E Axis Walking (状压dp lowbit优化)

时间：2015-07-31 06:37:53 阅读：170 评论：0 收藏：0 [点我收藏+]

E. Axis Walking
time limit per test：3 seconds
memory limit per test：512 megabytes

Iahub wants to meet his girlfriend Iahubina. They both live in Ox axis (the horizontal axis). Iahub lives at point 0 and Iahubina at point d.
Iahub has n positive integers a1, a2, ..., an. The sum of those numbers is d. Suppose p1, p2, ..., pn is a permutation of {1,?2,?...,?n}. Then, let b1?=?ap1, b2?=?ap2 and so on. The array b is called a "route". There are n! different routes, one for each permutation p.
Iahub‘s travel schedule is: he walks b1 steps on Ox axis, then he makes a break in point b1. Then, he walks b2 more steps on Ox axis and makes a break in point b1?+?b2. Similarly, at j-th (1?≤?j?≤?n) time he walks bj more steps on Ox axis and makes a break in point b1?+?b2?+?...?+?bj.
Iahub is very superstitious and has k integers which give him bad luck. He calls a route "good" if he never makes a break in a point corresponding to one of those k numbers. For his own curiosity, answer how many good routes he can make, modulo 1000000007 (109?+?7).

Input

The first line contains an integer n (1?≤?n?≤?24). The following line contains n integers: a1,?a2,?...,?an (1?≤?ai?≤?109).
The third line contains integer k (0?≤?k?≤?2). The fourth line contains k positive integers, representing the numbers that give Iahub bad luck. Each of these numbers does not exceed 109.

Output

Output a single integer — the answer of Iahub‘s dilemma modulo 1000000007 (109?+?7).
Sample test(s)

Input

3
2 3 5
2
5 7
Output
1

Input
3
2 2 2
2
1 3
Output
6

Note
In the first case consider six possible orderings:
    [2, 3, 5]. Iahub will stop at position 2, 5 and 10. Among them, 5 is bad luck for him.
    [2, 5, 3]. Iahub will stop at position 2, 7 and 10. Among them, 7 is bad luck for him.
    [3, 2, 5]. He will stop at the unlucky 5.
    [3, 5, 2]. This is a valid ordering.
    [5, 2, 3]. He got unlucky twice (5 and 7).
    [5, 3, 2]. Iahub would reject, as it sends him to position 5.

In the second case, note that it is possible that two different ways have the identical set of stopping. In fact, all six possible ways have the same stops: [2, 4, 6], so there‘s no bad luck for Iahub.

题目链接：http://codeforces.com/contest/327/problem/E

题目大意：给一个序列，可以任意重排，但是前缀和不能出现给定数字中的数，问有几种排列方式

题目分析：n小于等于24，毕竟是cf，跑的快，状压搞一下，sum数组记录状态，即有哪些数字被选了(1表示被选)，这样就可以简单的枚举全排列的状态了，用dp记下数，注意这里还需要用lowbit优化来降低复杂度

#include <cstdio>
#include <cstring>
#include <algorithm>
#define lowbit(x) (x & (-x))
#define ll long long
using namespace std;
int const MOD = 1e9 + 7;
int const MAX = (1 << 24) + 1;
ll sum[MAX], dp[MAX];
int a[MAX], no[2];

int main()
{
    int n, k;
    scanf("%d", &n);
    for(int i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
        sum[1 << i] = a[i];
    }
    scanf("%d", &k);
    for(int i = 0; i < k; i++)
        scanf("%d", &no[i]);
    dp[0] = 1;
    for(int i = 1; i < (1 << n); i++)
    {
        sum[i] = sum[i & ~lowbit(i)] + sum[lowbit(i)];
        if(sum[i] == no[0] || sum[i] == no[1])
            continue; 
        for(int j = i; j != 0; j -= lowbit(j))
        {
            dp[i] += dp[i & ~lowbit(j)];
            if(dp[i] > MOD)
                dp[i] -= MOD;
        }
    }
    printf("%I64d\n", dp[(1 << n) - 1]);
}

Codeforces 327E Axis Walking (状压dp lowbit优化)

原文：http://blog.csdn.net/tc_to_top/article/details/47162427

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年09月23日 (328)
2021年09月24日 (313)
2021年09月17日 (191)
2021年09月15日 (369)
2021年09月16日 (411)
2021年09月13日 (439)
2021年09月11日 (398)
2021年09月12日 (393)
2021年09月10日 (160)
2021年09月08日 (222)