HDU4947-莫比乌斯反演在序列问题上的应用

题目大意:

给你一个长度为$l$的数组,$q$次操作:

$1$ 让每个满足$gcd(i,n)=d$的位置$i$上加$v$.
$2$ 查询前缀和$[1,x]$.

题目思路:

修改:

考虑对于每个$i$有式子:
$a_i=v\ast [gcd(i,n)=d]$
$a_i=v\ast [gcd(\frac{i}{d},\frac{n}{d})=1]$
$={\sum }_{p|gcd(\frac{i}{d},\frac{n}{d})}^{}v\ast \mu (p)$
$={\sum }_{p|\frac{i}{d},p|\frac{n}{d}}^{}v\ast \mu (p)$
$={\sum }_{pd|\frac{i}{,}p|\frac{n}{d}}^{}v\ast \mu (p)$

由于$\frac{n}{d}$是已知量,所以我们可以枚举$p|\frac{n}{d}$.对于每个确定的$p$.
我们构造$f_{pd}+=v\ast \mu (p)$

那么这个时候$a_i={\sum }_{j|i}^{}{f}_j$

---

查询:

${\sum }_{i=1}^x{a}_i={\sum }_{i=1}^x{\sum }_{j|i}^{}{f}_j={\sum }_{j=1}^x{f}_j\ast \lfloor \frac{x}{j}\rfloor$

分块+树状数组维护即可.

AC代码:

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vll vector<ll>
#define fi first
#define se second
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
int u[maxn] , id[maxn] , bk[maxn] , p[maxn] , cnt;
ll sum[maxn];
int l;
ll lowbit(ll x){return x & -x;}
void add(ll x,ll c){while(x<=l){sum[x] += c;x += lowbit(x);}}
ll ask(ll x){ll ans=0;while(x){ans+=sum[x];x-=lowbit(x);}return ans;}
vector<int> f[maxn];
void init ()
{
    u[1] = 1;
    for (int i = 2 ; i < maxn ; i++){
        if (!bk[i]){
            p[++cnt] = i;
            u[i] = -1;
        }
        for (int j = 1 ; j <= cnt && i * p[j] < maxn ; j++){
            bk[i * p[j]] = 1;
            if (i % p[j] == 0) {
                u[i * p[j]] = 0;
                break;
            }else {
                u[i * p[j]] = -u[i];
            }
        }
    }
    for (int i = 1 ; i < maxn ; i++)
        for (int j = i ; j < maxn ; j += i)
            f[j].pb(i);
    return ;
}
int main()
{
    ios::sync_with_stdio(false);
    init();
    int q , cnt = 0;
    while (cin >> l >> q , l || q){
        for (int i = 1 ; i <= l ; i++) sum[i] = 0;
        cout << "Case #" << (++cnt) << ":" << endl;
        for (int i = 1 ; i <= q ; i++){
            int op; cin >> op;
            if (op == 1){
                int n , d , v; cin >> n >> d >> v;
                if (n % d) continue;
                for (auto p : f[n / d]) add(p * d , 1ll * v * u[p]);
            }else {
                int x; cin >> x;
                ll ans = 0;
                for (int ls = 1 , r ; ls <= x ; ls = r + 1){
                    r = x / (x / ls);
                    ll a = ask(r) - ask(ls - 1);
                    ans += a * (x / ls);
                }
                cout << ans << endl;
            }
        }

    }
    return 0;
}