cf547C. Mike and Foam

链接

点击跳转

题解

令$m=max(a_i)$，$c_i$表示$i$这个数字的出现次数

$$2\times ans=\sum _{i=1}^m\sum _{j=1}^m{c}_i{c}_j[(i,j)=1]-c_1^2$$

对那个和式化简，得到

$$\sum _{d=1}^m\mu (d){\left(\sum _{d|i}^m{c}_i\right)}^2$$

对每个$d$维护括号里那个东西

就做完了

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
struct EasyMath
{
    ll prime[maxn], phi[maxn], mu[maxn];
    bool mark[maxn];
    ll fastpow(ll a, ll b, ll c)
    {
        ll t(a%c), ans(1ll);
        for(;b;b>>=1,t=t*t%c)if(b&1)ans=ans*t%c;
        return ans;
    }
    void shai(ll N)
    {
        ll i, j;
        for(i=2;i<=N;i++)mark[i]=false;
        *prime=0;
        phi[1]=mu[1]=1;
        for(i=2;i<=N;i++)
        {
            if(!mark[i])prime[++*prime]=i, mu[i]=-1, phi[i]=i-1;
            for(j=1;j<=*prime and i*prime[j]<=N;j++)
            {
                mark[i*prime[j]]=true;
                if(i%prime[j]==0)
                {
                    phi[i*prime[j]]=phi[i]*prime[j];
                    break;
                }
                mu[i*prime[j]]=-mu[i];
                phi[i*prime[j]]=phi[i]*(prime[j]-1);
            }
        }
    }
}em;
ll n, a[maxn], f[maxn], m=5e5, now, alive[maxn], c[maxn];
vector<ll> factor[maxn];
void change(ll x, ll v)
{
    #define sqr(x) ((x)*(x))
    for(auto d:factor[x])
    {
        now -= sqr(f[d])*em.mu[d];
        f[d]+=v;
        now += sqr(f[d])*em.mu[d];
    }
    c[x]+=v;
}
int main()
{
    ll i, j, q, x;
    em.shai(m);
    for(i=1;i<=m;i++)for(j=i;j<=m;j+=i)factor[j].emb(i);
    n=read(), q=read();
    rep(i,n)a[i]=read();
    while(q--)
    {
        x=read();
        if(alive[x])change(a[x],-1);
        else change(a[x],1);
        alive[x]^=1;
        printf("%lld\n",(now-c[1])/2);
    }
    return 0;
}