【SDOI2014】BZOJ3529 数表题解（Mobius反演+树状数组+除法分块）

题目：BZOJ3529.
题目大意：设$f(i,j)={\sum }_{d|gcd(i,j)}d$，给定$Q$组询问，每次询问$n,m,a$，求${\sum }_{i=1}^n{\sum }_{j=1,f(i,j)\le a}^{m}f(i,j)$.
$1\le n,m\le 10^5,1\le q\le 2\ast 10^4,1\le |a|\le 10^9$.

先考虑没有$a$限制的情况，那么：
$$\begin{gathered} \sum _{i=1}^n\sum _{j=1}^{m}f(i,j) \\ =\sum _{i=1}^n\sum _{j=1}^m\sum _{d|gcd(i,j)}d \\ =\sum _{d=1}^{min(n,m)}(\sum _{t|d}t)(\sum _{i=1}^n\sum _{j=1}^m[gcd(i,j)=d]) \end{gathered}$$

设$\sigma (n)={\sum }_{d|n}d$，那么：
$$\begin{gathered} \sum _{d=1}^{min(n,m)}(\sum _{t|d}t)(\sum _{i=1}^n\sum _{j=1}^m[gcd(i,j)=d]) \\ =\sum _{d=1}^{min(n,m)}\sigma (d)\sum _{i=1}^n\sum _{j=1}^m[gcd(i,j)=d] \\ =\sum _{d=1}^{min(n,m)}\sigma (d)\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{d}\rfloor }[gcd(i,j)=1] \\ =\sum _{d=1}^{min(n,m)}\sigma (d)\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{d}\rfloor }\sum _{t|i\wedge t|j}\mu (t) \\ =\sum _{d=1}^{min(n,m)}\sigma (d)\sum _{t=1}^{\lfloor \frac{min(n,m)}{d}\rfloor }\mu (t)\lfloor \frac{n}{dt}\rfloor \lfloor \frac{m}{dt}\rfloor \end{gathered}$$

考虑枚举$c=dt$，那么：
$$\begin{gathered} =\sum _{d=1}^{min(n,m)}\sigma (d)\sum _{t=1}^{\lfloor \frac{min(n,m)}{d}\rfloor }\mu (t)\lfloor \frac{n}{dt}\rfloor \lfloor \frac{m}{dt}\rfloor \\ =\sum _{c=1}^{min(n,m)}\lfloor \frac{n}{c}\rfloor \lfloor \frac{m}{c}\rfloor \sum _{d|c}\mu (\frac{c}{d})\sigma (d) \end{gathered}$$

线性筛出$\mu$和$\sigma$并预处理出它们的dirichlet卷积的前缀和$g$，然后除法分块处理即可做到$O(\sqrt{n})$处理一次询问.

考虑离线处理$a$的限制.我们先对询问按照$a$排序，把所有$d$按照$\sigma (d)$大小排序，并用树状数组动态维护$g$，即可做到$O(n{\log }^{2}n+Q\sqrt{n}\log n)$.

具体来说，每次当我们要加入一个数$d$的贡献时，我们枚举$d$的倍数，把这些倍数加上$d$的贡献.查询时用树状数组维护前缀和即可.

代码如下：

#include<bits/stdc++.h>
  using namespace std;

#define Abigail inline void
typedef long long LL;

const int N=100000,Q=20000;
const LL mod=(1LL<<31)-1;

int tp,pr[N+9],b[N+9];
LL mu[N+9],sigma[N+9],sd[N+9];

void sieve(int n){      //先把约数和函数筛错，重写一遍后再把Mobius函数筛错的我是不是没了...
  for (int i=2;i<=n;++i) b[i]=1;
  sigma[1]=mu[1]=1;int v;
  for (int i=2;i<=n;++i){
  	if (b[i]) pr[++tp]=i,mu[i]=-1,sigma[i]=sd[i]=i+1;
  	for (int j=1;j<=tp&&i*pr[j]<=n;++j){
  	  b[v=i*pr[j]]=0;
  	  if (i%pr[j]==0){
  	  	mu[v]=0;
  	  	sd[v]=sd[i]*pr[j]+1;sigma[v]=sigma[i]/sd[i]*sd[v];
  	    break;
  	  }
  	  mu[v]=-mu[i];
  	  sd[v]=pr[j]+1;sigma[v]=sigma[i]*sigma[pr[j]];
  	}
  }
}

int t;
struct Question{
  int n,m,id;
  LL a;
}q[Q+9];
LL ans[Q+9];

bool cmp1(const Question &a,const Question &b){return a.a<b.a;}

int d[N+9];

bool cmp2(const int &a,const int &b){return sigma[a]<sigma[b];}

LL g[N+9];

void Bit_add(int x,LL v){for (;x<=N;x+=x&-x) g[x]+=v;}
LL Bit_query(int x){LL sum=0;for (;x;x-=x&-x) sum+=g[x];return sum;}
LL Bit_query(int x,int y){return Bit_query(y)-Bit_query(x-1);}

void solve_add(int x){
  for (int i=1;i*x<=N;++i)
    Bit_add(i*x,sigma[x]*mu[i]);
}

LL solve_query(int n,int m){
  LL ans=0;
  if (n>m) swap(n,m);
  for (int l=1,r;l<=n;l=r+1){
  	r=min(n/(n/l),m/(m/l));
  	ans+=(n/l)*(m/l)*Bit_query(l,r);
  }
  return ans;
}

Abigail into(){
  scanf("%d",&t);
  for (int i=1;i<=t;++i){ 
    scanf("%d%d%lld",&q[i].n,&q[i].m,&q[i].a);
    q[i].id=i;
  } 
}

Abigail work(){
  sieve(N);
  sort(q+1,q+1+t,cmp1);
  for (int i=1;i<=N;++i) d[i]=i;
  sort(d+1,d+1+N,cmp2);
  int now=0;
  for (int i=1;i<=t;++i){
  	while (now<N&&sigma[d[now+1]]<=q[i].a) solve_add(d[++now]);
    ans[q[i].id]=solve_query(q[i].n,q[i].m);
  }
}

Abigail outo(){
  for (int i=1;i<=t;++i)
    printf("%lld\n",ans[i]&mod);
}

int main(){
  into();
  work();
  outo();
  return 0;
}