hdu6711 Touma Kazusa's function

链接

点击跳转

先来看看求的是什么东西

令$c_i$表示数字$i$在给定区间中出现了几次，$n=10^7$

$$\sum _{i=l}^r\sum _{j=l}^r\phi (gcd(a_i,a_j))lcm(a_i,a_j)$$

$$=\sum _{i=1}^n\sum _{j=1}^n\phi (gcd(i,j))lcm(i,j)c_i{c}_j$$

$$=\sum _{d=1}^{n}d\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{d}\rfloor }\phi (d)ij{c}_{id}{c}_{jd}[(i,j)=1]$$

$$=\sum _{d=1}^{n}d\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{d}\rfloor }\phi (d)ij{c}_{id}{c}_{jd}\sum _{t|i\wedge t|j}\mu (t)$$

$$=\sum _{d=1}^{n}d\phi (d)\sum _{t=1}^{\lfloor \frac{n}{d}\rfloor }{t}^2\mu (t)\sum _{i=1}^{\lfloor \frac{n}{dt}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{dt}\rfloor }ij{c}_{idt}{c}_{jdt}$$

$$=\sum _{d=1}^{n}d\phi (d)\sum _{t=1}^{\lfloor \frac{n}{d}\rfloor }{t}^2\mu (t)(\sum _{i=1}^{\lfloor \frac{n}{dt}\rfloor }i{c}_{idt}{)}^2$$

换元，令$T=dt$

$$=\sum _{T=1}^n\sum _{d|T}d\phi (d)\frac{T^2}{d^2}\mu (\frac{T}{d})(\sum _{i=1}^{\lfloor \frac{n}{T}\rfloor }i{c}_{iT}{)}^2$$

注意看$g(T)={\sum }_{d|T}d\phi (d)\frac{T^2}{d^2}\mu (\frac{T}{d})$

这玩意是个积性函数，对$T=p^k$分析发现，$g(T)=T\mu (T)$

上式接着化简

$$ans=\sum _{T=1}^{n}T\mu (T)(\sum _{i=1}^{\lfloor \frac{n}{T}\rfloor }i{c}_{iT}{)}^2$$

莫队搞一搞

别以为到这里就结束了

卡常简直把我给搞自闭了

必须写的优美否则就会$TLE$成狗

我的自闭过程：

代码

#include <bits/stdc++.h>
#define maxn 100010
#define maxN 10000010
#define rep(_,__) for(_=1;_<=(__);_++)
#define sqr(x) ((x)*(x))
using namespace std;
typedef unsigned int uint;
typedef pair<uint,uint> pr;
uint prime[maxN/10], mu[maxN];
bool mark[maxN];
void shai(uint N)
{
    uint i, j;
    for(i=2;i<=N;i++)mark[i]=false;
    *prime=0;
    mu[1]=1;
    for(i=2;i<=N;i++)
    {
        if(!mark[i])prime[++*prime]=i, mu[i]=-1;
        for(j=1;j<=*prime and i*prime[j]<=N;j++)
        {
            mark[i*prime[j]]=true;
            if(i%prime[j]==0)break;
            mu[i*prime[j]]=-mu[i];
        }
    }
}
uint l[maxn], r[maxn], id[maxn], s[maxN], now, a[maxn], ans[maxn], S;
vector<pr> d[maxn];
void init()
{
    uint i, j;
    shai(10000000);
}
bool cmp(uint x, uint y)
{
    if(l[x]/S==l[y]/S)return r[x]<r[y];
    return l[x]/S < l[y]/S;
}
void upd(uint x, bool pos, vector<pr> &d)
{
    for(auto T:d)
    {
        uint dlt = pos ? x/T.first : -(x/T.first);
        now += T.second*dlt*((s[T.first]<<1)+dlt);
        s[T.first] += dlt;
    }
}
uint read(uint x=0)
{
    uint c;
    for(c=getchar();!isdigit(c);c=getchar());
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return x;
}
int main()
{
    uint T, n, q, i, L, R, j;
    init();
    T=read();
    while(T--)
    {
        n=read(), q=read();
        S = sqrt(n);
        rep(i,n)
        {
            a[i]=read();
            d[i].clear();
            for(j=1;j*j<=a[i];j++)
                if(a[i]%j==0)
                {
                    if(mu[j])
                        d[i].emplace_back(pr(j,j*mu[j]));
                    if(j!=a[i]/j and mu[a[i]/j])
                        d[i].emplace_back(pr(a[i]/j,a[i]/j*mu[a[i]/j]));
                    s[j]=s[a[i]/j]=0;
                }
        }
        rep(i,q)
        {
            l[i]=read(), r[i]=read();
            id[i]=i;
        }
        sort(id+1,id+q+1,cmp);
        now = 0;
        L=1, R=0;
        rep(i,q)
        {
            for(;L<l[id[i]];L++)upd(a[L],false,d[L]);
            for(;L>l[id[i]];L--)upd(a[L-1],true,d[L-1]);
            for(;R>r[id[i]];R--)upd(a[R],false,d[R]);
            for(;R<r[id[i]];R++)upd(a[R+1],true,d[R+1]);
            ans[id[i]]=now;
        }
        rep(i,q)
        {
            printf("%u\n",ans[i]);
        }
    }
    return 0;
}