题目链接
题意:
有n中石头,第i种有ai个,随意取石头排成一个序列,问:有多少种非空排列方式。
题解:
首先一个队都在想生成函数:显然是生成函数的模板题,但是一看模数是1e9+7懵了。队友的MTT当场tle。然后陷入了沉思到比赛结束。比赛后一看题解,很好,dp。然后一看HDU的时限是15s(中石油oj是1s)。队友当场口吐芬芳,在HDU交了一发MTT,遂过。本憨批不会MTT,只得用dp做,QAQ。
首先考虑dp[i][j]为考虑前i种石头,序列长度为j的求法。显然是个很水dp,,(上了就想生成函数太伤了)。在考虑第i种时就是拿出k个,插入到长度为j的序列中,显然用隔板法。有转移方程。
d
p
[
i
]
[
j
]
=
∑
k
=
0
m
i
n
(
n
u
m
[
i
]
,
j
)
d
p
[
i
−
1
]
[
j
−
k
]
∗
C
j
k
dp[i][j] =\sum_{k=0}^{min(num[i],j)} dp[i-1][j-k]*C_j^k
dp[i][j]=k=0∑min(num[i],j)dp[i−1][j−k]∗Cjk
写上去,HDU过了,中石油仍然tle。然后开始卡常,最后折腾了很久,不开O2仍然是tle(1100+ms)开了O2(700+ms)可以过。
下面是ac代码:
#include<cstdio>
#include<iostream>
#include<cstring>
#include <map>
#include <queue>
#include <set>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <bitset>
#include <array>
#include <cctype>
#include <time.h>
#pragma GCC optimize(2)
void read_f() { freopen("1.in", "r", stdin); freopen("1.out", "w", stdout); }
void fast_cin() { std::ios::sync_with_stdio(false); std::cin.tie(); }
void run_time() { std::cout << "ESC in : " << clock() * 1000.0 / CLOCKS_PER_SEC << "ms" << std::endl; }
template <typename T>
bool bacmp(const T & a, const T & b) { return a > b; }
template <typename T>
bool pecmp(const T & a, const T & b) { return a < b; }
#define ll long long
#define ull unsigned ll
#define _min(x, y) ((x)>(y)?(y):(x))
#define _max(x, y) ((x)>(y)?(x):(y))
#define max3(x, y, z) ( max( (x), max( (y), (z) ) ) )
#define min3(x, y, z) ( min( (x), min( (y), (z) ) ) )
#define pr(x, y) (make_pair((x), (y)))
#define pb(x) push_back(x);
using namespace std;
const int N = 1e2+5;
const int inf= 0x3f3f3f3f;
const int mod = 1e9+7;
int n;
int su[N];
int dp[N][N*N];
int c[N*N][N];
void init()
{
c[0][0] = 1;
for (int i = 1; i < N * N; i++)
{
c[i][0] = 1;
int f = i < N-1 ? i : N-1;
for (int j = 1; j <= f; j++)
{
c[i][j] = (c[i-1][j-1] + c[i-1][j])%mod;
}
}
}
int main()
{
init();
int t0 = 1;
while(scanf("%d", &n) != EOF)
{
int sum = 0;
int g = 0;
for (int i = 1; i <= n; i++)
{
scanf("%d", &su[i]);
memset(dp[i], 0, sizeof(dp[i]));
}
dp[0][0] = 1;
for (int i = 1; i <= n; i++)
{
sum += su[i];
for (int j = 0; j <= sum; j++)
{
for (int k = 0; k <= su[i]; k++)
{
if (k > j) break;
dp[i][j] = (dp[i][j] + 1ll * dp[i-1][j-k] * c[j][k] ) % mod;
}
}
}
int ans = 0;
for (int i = 1; i <= sum; i++)
ans = (ans + dp[n][i]) % mod;
printf("Case %d: %d\n",t0++, ans);
}
return 0;
}