[bzoj4559][loj2026][JLoi2016]成绩比较【拉格朗日插值法】【dp】

【题目链接】
　　https://www.lydsy.com/JudgeOnline/problem.php?id=4559
　　https://loj.ac/problem/2026
【题解】
　　记$f_{i,j}$表示当前统计到第$i$门课程，仍然有$j$个人被碾压，可以枚举通过上一门课程的碾压人数来转移。
　　记$g_{i}$表示第$i$门课可行的方案数。
　　$f_{i,j}=\sum_{t=j}^{n}f_{i-1,t}*C(n-1-t,rank_{i}-1-(t-j))*C(t,j)*g_{i}$
　　第一个组合数计算的是其他不被碾压的人组合的方案数，第二个是选择那些人被碾压的方案数。
　　$g_{i}=\sum_{i=1}^{U_{i}}i^{n-rank_{i}}*(U-i)^{rank_{i}-1}$
　　显然这是一个$n+1$次多项式，可以用插值法解决。
　　最后$f_{m,k}$即为答案。
　　时间复杂度$O(N^3)$
【代码】

/* - - - - - - - - - - - - - - -
    User :      VanishD
    problem :
    Points :    
- - - - - - - - - - - - - - - */
# include <bits/stdc++.h>
# define    ll      long long
# define    inf     0x3f3f3f3f
# define    N       110
using namespace std;
int read(){
    int tmp = 0, fh = 1; char ch = getchar();
    while (ch < '0' || ch > '9'){ if (ch == '-') fh = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9'){ tmp = tmp * 10 + ch - '0'; ch = getchar(); }
    return tmp * fh;
}
const int P = 1e9 + 7;
int n, m, k, lim[N], f[N][N], rk[N], c[N][N], num[N], x[N], y[N]; 
int power(int x, int y){
    int i = x; x = 1;
    while (y > 0){
        if (y % 2 == 1) x = 1ll * i * x % P;
        i = 1ll * i * i % P;
        y /= 2;
    }
    return x;
}
int solve(int lim, int n, int m){
    int num = n + m + 2, sum = 0;
    for (int i = 1; i <= num; i++) 
        x[i] = i, y[i] = (y[i - 1] + 1ll * power(i, n) * power(lim - i, m)) % P;
    for (int i = 1; i <= num; i++){
        int num1 = 1, num2 = 1;
        for (int j = 1; j <= num; j++){
                if (i != j){
                    num1 = 1ll * num1 * (lim - x[j]) % P;
                    num2 = 1ll * num2 * (x[i] - x[j]) % P;
                }
        }
        sum = (sum + 1ll * num1 * y[i] % P * power(num2, P - 2)) % P;
    }
    return sum;
}
int main(){
//  freopen(".in", "r", stdin);
//  freopen(".out", "w", stdout);
    n = read() - 1, m = read(), k = read();
    for (int i = 1; i <= m; i++) lim[i] = read();
    for (int i = 1; i <= m; i++) rk[i] = read() - 1;
    c[0][0] = 1;
    for (int i = 1; i <= n; i++){
        c[i][0] = 1;
        for (int j = 1; j <= i; j++)
            c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % P;
    }
    for (int i = 1; i <= m; i++) num[i] = solve(lim[i], n - rk[i], rk[i]);
    f[0][n] = 1;
    for (int i = 1; i <= m; i++)
        for (int j = k; j <= n; j++)
            for (int t = j; t <= n; t++){
                int num1 = t - j, num2 = j;
                if (num1 > rk[i] || num2 > n - rk[i]) continue;
                f[i][j] = (f[i][j] + 1ll * c[t][j] % P * c[n - t][rk[i] - num1] % P * num[i] % P * f[i - 1][t]) % P;
            }
    printf("%d\n", (f[m][k] + P) % P);
    return 0;
}