【BZOJ5339】【TJOI2018】教科书般的亵渎

【题目链接】

• 点击打开链接
  

【思路要点】

• 模拟题目中的过程，我们本质上需要回答\(O(M^2)\)个形如求\(\sum_{i=L}^{R}i^{M+1}\)的询问。
• 拉格朗日插值即可。
• 时间复杂度\(O(TM^3)\)。

【代码】

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 105;
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 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;
}
namespace Lagrange {
	int N, x[MAXN], y[MAXN], a[MAXN];
	void work() {
		memset(a, 0, sizeof(a));
		static int p[MAXN], q[MAXN];
		memset(p, 0, sizeof(p)); p[0] = 1;
		for (int i = 1; i <= N; i++) {
			int now = P - x[i];
			for (int j = i; j >= 1; j--)
				p[j] = (1ll * p[j] * now + p[j - 1]) % P;
			p[0] = 1ll * p[0] * now % P;
		}
		for (int i = 1; i <= N; i++) {
			memset(q, 0, sizeof(q));
			for (int j = N; j >= 0; j--)
				q[j] = (p[j + 1] + 1ll * q[j + 1] * x[i]) % P;
			int mul = 1;
			for (int j = 1; j <= N; j++)
				if (i != j) mul = 1ll * mul * (x[i] - x[j]) % P;
			if (mul < 0) mul = P + mul;
			mul = 1ll * power(mul, P - 2) * y[i] % P;
			for (int j = 0; j <= N; j++)
				a[j] = (a[j] + 1ll * q[j] * mul) % P;
		}
	}
	int calc(long long n) {
		n %= P;
		int ans = 0, now = 1;
		for (int i = 0; i <= N; i++) {
			ans = (ans + 1ll * now * a[i]) % P;
			now = 1ll * now * n % P;
		}
		return ans;
	}
	void calc(long long n, int m) {
		static long long x[MAXN];
		for (int i = 1; i <= m; i++)
			read(x[i]);
		sort(x + 1, x + m + 1);
		x[m + 1] = n + 1;
		int ans = 0;
		for (int i = 0; i <= m; i++)
		for (int j = i; j <= m; j++)
			ans = (ans + calc(x[j + 1] - x[i] - 1) - calc(x[j] - x[i])) % P;
		writeln((ans % P + P) % P);
	}
}
int main() {
	int T; read(T);
	while (T--) {
		long long n; int m;
		read(n), read(m);
		using namespace Lagrange;
		N = m + 5;
		for (int i = 1; i <= m + 5; i++) {
			x[i] = i;
			y[i] = (y[i - 1] + power(i, m + 1)) % P;
		}
		work();
		calc(n, m);
	}
	return 0;
}