P3700 [CQOI2017]小Q的表格

給定一個大小為$n\times n$的表格，初始時$i,j$位置上填的是$f(i,j)=i\times j$，有$m$個操作，每次操作給定$a,b,x,k$，把格子$a,b$上的值改成$x$，求$\sum _{i=1}^k\sum _{j=1}^{k}f(i,j)$。

我們定義，在任何時刻，表格里的值都滿足$f(i,j)=f(j,i),j\times f(i,i+j)=(i+j)\times f(i,j)$。
$$\begin{gathered} b\times f(a,a+b)=(a+b)\times f(a,b) \\ \frac{f(a,a+b)}{a\times (a+b)}=\frac{f(a,b)}{a\times b} \\ \frac{f(a,b)}{a\times b}=\frac{f(b,a\%b)}{b\times a\%b} \\ \frac{f(a,b)}{a\times b}=\frac{f(d,d)}{d\times d},d=\gcd (a,b) \\ f(a,b)=\frac{a\times b}{d\times d}f(d,d) \end{gathered}$$

考慮統(tǒng)計答案：
$$\begin{gathered} \sum _{i=1}^n\sum _{j=1}^{n}f(i,j) \\ \sum _{d=1}^{n}f(d,d)\sum _{i=1}^{\frac{n}{d}}\sum _{j=1}^{\frac{n}{d}}ij[\gcd (i,j)=1] \\ \sum _{d=1}^{n}f(d,d)?\sum _{i=1}^{\frac{n}{d}}i\sum _{j=1}^{i}j[\gcd (i,j)?1]?1? \\ \sum _{d=1}^{n}f(d,d)\sum _{i=1}^{\frac{n}{d}}{i}^2?(i) \\ g(n)=\sum _{i=1}^n{i}^2\times ?(i) \end{gathered}$$
容易發(fā)現(xiàn)$g(n)$可以線性篩得到，所以我們只要動態(tài)維護$f(d,d)$的前綴和即可，考慮用分塊維護前綴和，滿足$\sqrt{n}$修改，$O(1)$查詢。

#include <bits/stdc++.h>using namespace std;const int N = 4e6 + 10, mod = 1e9 + 7;int prime[N], phi[N], g[N], f[N], cnt, n, m;int L[N], R[N], id[N], sum[N], lazy[N], block, blocks;bool st[N];inline int add(int x, int y) {return x + y < mod ? x + y : x + y - mod; }inline int sub(int x, int y) {return x >= y ? x - y : x - y + mod; }void init() {phi[1] = 1;for (int i = 2; i < N; i++) {if (!st[i]) {prime[++cnt] = i;phi[i] = i - 1;}for (int j = 1; j <= cnt && 1ll * i * prime[j] < N; j++) {st[i * prime[j]] = 1;if (i % prime[j] == 0) {phi[i * prime[j]] = phi[i] * prime[j];break;}phi[i * prime[j]] = phi[i] * (prime[j] - 1);}}for (int i = 1; i < N; i++) {g[i] = add(g[i - 1], 1ll * i * i % mod * phi[i] % mod);f[i] = 1ll * i * i % mod, sum[i] = add(sum[i - 1], f[i]);}block = sqrt(n);for (int i = 1; i <= n; i += block) {L[++blocks] = i, R[blocks] = min(i + block - 1, n);for (int j = L[blocks]; j <= R[blocks]; j++) {id[j] = blocks;}} }inline int query(int x) {return add(sum[x], lazy[id[x]]); }inline void update(int x, int v) {int pos = id[x];for (int i = x; i <= R[pos]; i++) {sum[i] = add(sum[i], v);}pos++;while (pos <= blocks) {lazy[pos] = add(lazy[pos], v);pos++;} }int main() {// freopen("in.txt", "r", stdin);// freopen("out.txt", "w", stdout);scanf("%d %d", &m, &n);init();for (int cas = 1, a, b, k; cas <= m; cas++) {long long x;scanf("%d %d %lld %d", &a, &b, &x, &k);int p = __gcd(a, b);update(p, sub(0, f[p]));f[p] = (x / (a / p)) / (b / p) % mod;update(p, f[p]);int ans = 0;for (int l = 1, r; l <= k; l = r + 1) {r = k / (k / l);ans = add(ans, 1ll * g[k / l] * sub(query(r), query(l - 1)) % mod);}printf("%d\n", ans);}return 0; }

總結

以上是生活随笔為你收集整理的P3700 [CQOI2017]小Q的表格（反演、分块）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內容還不錯，歡迎將生活随笔推薦給好友。