【题目链接】
【思路要点】
- 首先，求出 L L L 的任意原根 g g g ，以及其 k k k 次单位根 w w w 。
- 记初始给定的矩阵为 m a t mat mat ，那么答案 a n s t ans_t anst 应当满足
a n s t = ∑ i = 0 L ( L i ) ( m a t i ) x , y [ i % k = t ] ans_t=\sum_{i=0}^{L}\binom{L}{i}(mat^i)_{x,y}[i\%k=t] anst=i=0∑L(iL)(mati)x,y[i%k=t]- 将 [ i % k = t ] [i\%k=t] [i%k=t] 展开为 1 k ∑ j = 0 k − 1 w j ( i − t ) \frac{1}{k}\sum_{j=0}^{k-1}w^{j(i-t)} k1∑j=0k−1wj(i−t) ，则有
k × a n s t = ∑ i = 0 L ( L i ) ( m a t i ) x , y ∑ j = 0 k − 1 w j ( i − t ) k\times ans_t=\sum_{i=0}^{L}\binom{L}{i}(mat^i)_{x,y}\sum_{j=0}^{k-1}w^{j(i-t)} k×anst=i=0∑L(iL)(mati)x,yj=0∑k−1wj(i−t)
k × a n s t = ∑ j = 0 k − 1 w − j t ∑ i = 0 L ( L i ) w i j ( m a t i ) x , y k\times ans_t=\sum_{j=0}^{k-1}w^{-jt}\sum_{i=0}^{L}\binom{L}{i}w^{ij}(mat^i)_{x,y} k×anst=j=0∑k−1w−jti=0∑L(iL)wij(mati)x,y
k × a n s t = ∑ j = 0 k − 1 w − j t ( ( w j m a t + I ) L ) x , y k\times ans_t=\sum_{j=0}^{k-1}w^{-jt}((w^jmat+I)^L)_{x,y} k×anst=j=0∑k−1w−jt((wjmat+I)L)x,y- 那么 w − ( t 2 ) × k × a n s t = ∑ j = 0 k − 1 w − ( j + t 2 ) × w ( j 2 ) ( ( w j m a t + I ) L ) x , y w^{-\binom{t}{2}}\times k\times ans_t=\sum_{j=0}^{k-1}w^{-\binom{j+t}{2}}\times w^{\binom{j}{2}}((w^jmat+I)^L)_{x,y} w−(2t)×k×anst=j=0∑k−1w−(2j+t)×w(2j)((wjmat+I)L)x,y
- 使用任意模数 F F T FFT FFT 计算之即可。
- 时间复杂度 O ( L + N 3 K L o g L + K L o g K ) O(\sqrt{L}+N^3KLogL+KLogK) O(L+N3KLogL+KLogK) 。
【代码】
#include<bits/stdc++.h> using namespace std; const int MAXN = 262144; typedef long long ll; typedef long double ld; typedef unsigned long long ull; 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(""); } namespace AnyModuloFFT { const int MAXN = 262144; const long double pi = acosl(-1); struct point {long double x, y; }; point operator + (point a, point b) {return (point) {a.x + b.x, a.y + b.y}; } point operator - (point a, point b) {return (point) {a.x - b.x, a.y - b.y}; } point operator * (point a, point b) {return (point) {a.x * b.x - a.y * b.y, a.x * b.y + a.y * b.x}; } point operator / (point a, long double x) {return (point) {a.x / x, a.y / x}; } int N, Log, home[MAXN]; point tmp[MAXN]; void FFTinit() { for (int i = 0; i < N; i++) { int tmp = i, ans = 0; for (int j = 1; j <= Log; j++) { ans <<= 1; ans += tmp & 1; tmp >>= 1; } home[i] = ans; } } void FFT(point *a, int mode) { for (int i = 0; i < N; i++) if (home[i] < i) swap(a[i], a[home[i]]); for (int len = 2; len <= N; len <<= 1) { point delta = (point) {cosl(2 * pi / len * mode), sinl(2 * pi / len * mode)}; for (int i = 0; i < N; i += len) { point now = (point) {1, 0}; for (int j = i, k = i + len / 2; k < i + len; j++, k++) { point tmp = a[j]; point tnp = a[k] * now; a[j] = tmp + tnp; a[k] = tmp - tnp; now = now * delta; } } } if (mode == -1) { for (int i = 0; i < N; i++) a[i] = a[i] / N; } } void times(int *a, int *b, int *c, int P, int limit) { N = 1, Log = 0; while (N <= 2 * limit) { N <<= 1; Log++; } static point ax[MAXN], ay[MAXN]; static point bx[MAXN], by[MAXN]; for (int i = 0; i <= limit; i++) { ax[i] = (point) {a[i] & 32767, 0}; ay[i] = (point) {a[i] >> 15, 0}; bx[i] = (point) {b[i] & 32767, 0}; by[i] = (point) {b[i] >> 15, 0}; } for (int i = limit + 1; i < N; i++) { ax[i] = (point) {0, 0}; ay[i] = (point) {0, 0}; bx[i] = (point) {0, 0}; by[i] = (point) {0, 0}; } FFTinit(); FFT(ax, 1), FFT(ay, 1), FFT(bx, 1), FFT(by, 1); static point x[MAXN], y[MAXN], z[MAXN]; for (int i = 0; i < N; i++) { x[i] = ax[i] * bx[i]; y[i] = ax[i] * by[i] + ay[i] * bx[i]; z[i] = ay[i] * by[i]; } FFT(x, -1), FFT(y, -1), FFT(z, -1); auto num = [&] (point x) { return (long long) (x.x + 0.5) % P; }; for (int i = 0; i < N; i++) { int res = num(z[i]); res = (32768ll * res + num(y[i])) % P; res = (32768ll * res + num(x[i])) % P; c[i] = res; } } } int n, k, l, x, y, P, g, w; int mat[3][3], f[MAXN], h[MAXN], res[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; } bool PrimitiveRoot(int g) { int phi = P - 1; for (int i = 2; i * i <= phi; i++) if (phi % i == 0) { while (phi % i == 0) phi /= i; if (power(g, (P - 1) / i) == 1) return false; } if (phi != 1 && power(g, (P - 1) / phi) == 1) return false; return true; } int pmat() { static int cur[3][3], res[3][3], tmp[3][3]; for (int i = 0; i <= n - 1; i++) for (int j = 0; j <= n - 1; j++) { res[i][j] = i == j; cur[i][j] = mat[i][j] + (i == j); if (cur[i][j] >= P) cur[i][j] -= P; } int lft = l; for (int p = 1; lft != 0; p <<= 1) { if (lft & p) { lft ^= p; for (int i = 0; i <= n - 1; i++) for (int j = 0; j <= n - 1; j++) { ll tres = 0; for (int k = 0; k <= n - 1; k++) tres += 1ll * res[i][k] * cur[k][j]; tmp[i][j] = tres % P; } memcpy(res, tmp, sizeof(res)); } for (int i = 0; i <= n - 1; i++) for (int j = 0; j <= n - 1; j++) { ll tres = 0; for (int k = 0; k <= n - 1; k++) tres += 1ll * cur[i][k] * cur[k][j]; tmp[i][j] = tres % P; } memcpy(cur, tmp, sizeof(cur)); } return res[x][y]; } int main() { read(n), read(k), read(l), read(x), read(y), read(P), x--, y--; g = 2; while (!PrimitiveRoot(g)) g++; w = power(g, (P - 1) / k); for (int i = 0; i <= n - 1; i++) for (int j = 0; j <= n - 1; j++) read(mat[i][j]); for (int i = 0, j = 2 * k - 2; i <= 2 * k - 2; i++, j--) { f[i] = power(w, P - 1 - j * (j - 1ll) / 2 % (P - 1)); if (i <= k - 1) h[i] = 1ll * pmat() * power(w, i * (i - 1ll) / 2 % (P - 1)) % P; for (int a = 0; a <= n - 1; a++) for (int b = 0; b <= n - 1; b++) mat[a][b] = 1ll * mat[a][b] * w % P; } AnyModuloFFT :: times(f, h, res, P, 2 * k - 2); int invk = power(k, P - 2); for (int i = 0, j = 2 * k - 2; i <= k - 1; i++, j--) writeln(1ll * res[j] * power(w, i * (i - 1ll) / 2 % (P - 1)) % P * invk % P); return 0; }
750
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
