【题目链接】
【思路要点】
- 直接上容斥原理。
- 时间复杂度\(O(NM)\)。
【代码】
#include<bits/stdc++.h> using namespace std; const int MAXN = 5005; const int P = 1e9 + 7; template <typename T> void chkmax(T &x, T y) {x = max(x, y); } template <typename T> void chkmin(T &x, T y) {x = min(x, y); } template <typename T> void read(T &x) { x = 0; int f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == '-') f = -f; for (; isdigit(c); c = getchar()) x = x * 10 + c - '0'; x *= f; } template <typename T> void write(T x) { if (x < 0) x = -x, putchar('-'); if (x > 9) write(x / 10); putchar(x % 10 + '0'); } template <typename T> void writeln(T x) { write(x); puts(""); } int n, m, a[MAXN]; int inv[MAXN], fac[MAXN]; int power(int x, int y) { if (y == 0) return 1; int tmp = power(x, y / 2); if (y % 2 == 0) return 1ll * tmp * tmp % P; else return 1ll * tmp * tmp % P * x % P; } int c(int x, int y) { return 1ll * fac[x] * inv[y] % P * inv[x - y] % P; } int calc(int x) { int ans = 1; for (int i = 1; i <= m; i++) ans = 1ll * ans * c(a[i] + x - 1, x - 1) % P; return ans; } int main() { read(n), read(m); for (int i = 1; i <= m; i++) read(a[i]); fac[0] = 1; for (int i = 1; i < MAXN; i++) fac[i] = 1ll * fac[i - 1] * i % P; inv[MAXN - 1] = power(fac[MAXN - 1], P - 2); for (int i = MAXN - 2; i >= 0; i--) inv[i] = inv[i + 1] * (i + 1ll) % P; int ans = 0; for (int i = n; i >= 1; i--) { if ((n - i) % 2 == 0) ans = (ans + 1ll * c(n, i) * calc(i)) % P; else ans = (ans - 1ll * c(n, i) * calc(i) % P + P) % P; } writeln(ans); return 0; }