题目
求
∑
i
=
1
n
∑
j
=
1
m
σ
g
c
d
(
i
,
j
)
[
σ
g
c
d
(
i
,
j
)
≤
w
]
\sum_{i=1}^{n}\sum_{j=1}^m\sigma_{gcd(i,j)}[\sigma_{gcd(i,j)}\leq w]
i=1∑nj=1∑mσgcd(i,j)[σgcd(i,j)≤w]
多组数据
分析
先把后面条件扔掉,默认
n
≤
m
n\leq m
n≤m
∑
i
=
1
n
∑
j
=
1
m
σ
g
c
d
(
i
,
j
)
=
∑
d
=
1
n
∑
i
=
1
⌊
n
d
⌋
∑
j
=
1
⌊
m
d
⌋
σ
d
[
g
c
d
(
i
,
j
)
=
=
1
]
\sum_{i=1}^{n}\sum_{j=1}^m\sigma_{gcd(i,j)}=\sum_{d=1}^n\sum_{i=1}^{\lfloor\frac{n}{d}\rfloor}\sum_{j=1}^{\lfloor\frac{m}{d}\rfloor}\sigma_d[gcd(i,j)==1]
i=1∑nj=1∑mσgcd(i,j)=d=1∑ni=1∑⌊dn⌋j=1∑⌊dm⌋σd[gcd(i,j)==1]
=
∑
d
=
1
n
∑
i
=
1
⌊
n
d
⌋
∑
j
=
1
⌊
m
d
⌋
∑
k
∣
i
,
k
∣
j
μ
(
k
)
=\sum_{d=1}^n\sum_{i=1}^{\lfloor\frac{n}{d}\rfloor}\sum_{j=1}^{\lfloor\frac{m}{d}\rfloor}\sum_{k|i,k|j}\mu(k)
=d=1∑ni=1∑⌊dn⌋j=1∑⌊dm⌋k∣i,k∣j∑μ(k)
=
∑
d
=
1
n
∑
k
=
1
⌊
n
d
⌋
μ
(
k
)
⌊
n
k
d
⌋
⌊
m
k
d
⌋
=\sum_{d=1}^n\sum_{k=1}^{\lfloor\frac{n}{d}\rfloor}\mu(k)\lfloor\frac{n}{kd}\rfloor\lfloor\frac{m}{kd}\rfloor
=d=1∑nk=1∑⌊dn⌋μ(k)⌊kdn⌋⌊kdm⌋
令
i
=
k
d
i=kd
i=kd,那么
=
∑
i
=
1
n
⌊
n
i
⌋
⌊
m
i
⌋
∑
d
∣
i
σ
d
μ
(
i
d
)
=\sum_{i=1}^{n}\lfloor\frac{n}{i}\rfloor\lfloor\frac{m}{i}\rfloor\sum_{d|i}\sigma_d\mu(\frac{i}{d})
=i=1∑n⌊in⌋⌊im⌋d∣i∑σdμ(di)
主要是后面这个部分,由于
σ
d
≤
w
\sigma_d\leq w
σd≤w的限制,考虑离线询问,用树状数组实时维护,用枚举倍数的方式,时间复杂度
O
(
q
n
l
o
g
n
+
n
l
o
g
2
n
)
O(q\sqrt nlogn+nlog^2n)
O(qnlogn+nlog2n)
代码
#include <cstdio>
#include <cctype>
#include <algorithm>
#define rr register
#define min(a,b) ((a)<(b)?(a):(b))
using namespace std;
const int N=100101,M=20101;
struct rec{int n,m,w,rk;}b[M];
int si[N],mu[N],rk[N],v[N],prime[M>>1],t,cnt,ans[M],c[N];
inline signed iut(){
rr int ans=0; rr char c=getchar();
while (!isdigit(c)) c=getchar();
while (isdigit(c)) ans=(ans<<3)+(ans<<1)+(c^48),c=getchar();
return ans;
}
bool cmp1(int x,int y){return si[x]<si[y];}
inline void init(int n){
si[1]=mu[1]=rk[1]=1;
for (rr int i=2;i<=n;++i){
rk[i]=i;
if (!v[i]) v[i]=si[i]=i+1,mu[prime[++cnt]=i]=-1;
for (rr int j=1;j<=cnt&&prime[j]*i<=n;++j){
if (!(i%prime[j])){
v[i*prime[j]]=v[i]*prime[j]+1;
si[i*prime[j]]=si[i]/v[i]*v[i*prime[j]];
break;
}
mu[i*prime[j]]=-mu[i];
v[i*prime[j]]=prime[j]+1;
si[i*prime[j]]=si[i]*v[i*prime[j]];
}
}
sort(rk+1,rk+1+n,cmp1);
}
bool cmp(rec x,rec y){return x.w<y.w;}
inline void add(int x,int y){while (x<=N) c[x]+=y,x+=-x&x;}
inline signed anss(int x){
rr int ans=0;
while (x) ans+=c[x],x-=-x&x;
return ans;
}
inline signed answ(int n,int m){
rr int ans=0,ls=0,now;
for (rr int l=1,r;l<=n;l=r+1,ls=now){
r=min(n/(n/l),m/(m/l)),now=anss(r);
ans+=(n/l)*(m/l)*(now-ls);
}
return ans;
}
void print(int ans){
if (ans>9) print(ans/10);
putchar(ans%10+48);
}
signed main(){
init(N); rr int t=iut();
for (rr int i=1;i<=t;++i){
rr int n=iut(),m=iut(),w=iut();
if (n>m) n^=m,m^=n,n^=m;
b[i]=(rec){n,m,w,i};
}
sort(b+1,b+1+t,cmp);
for (rr int i=1,j=1;i<=t;++i){
for (;j<=N&&si[rk[j]]<=b[i].w;++j)
for (rr int k=1;k*rk[j]<=N;++k)
if (mu[k]) add(k*rk[j],mu[k]*si[rk[j]]);
ans[b[i].rk]=answ(b[i].n,b[i].m);
}
for (rr int i=1;i<=t;++i) print(ans[i]+(ans[i]<0)*(1ll<<31)),putchar(10);
return 0;
}