cf86D. Powerful array

链接

点击跳转

题解

莫队

代码

#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;
}
ll a[maxn], cnt[maxn], ans[maxn], l[maxn], r[maxn], id[maxn], n, q, now;
void upd(ll pos, ll v)
{
    #define sqr(x) ((x)*(x))
    now-=sqr(cnt[a[pos]])*a[pos];
    cnt[a[pos]]+=v;
    now+=sqr(cnt[a[pos]])*a[pos];
}
int main()
{
    ll L, R, i, S=sqrt(2e5);
    n=read(), q=read();
    rep(i,n)a[i]=read();
    rep(i,q)l[i]=read(), r[i]=read(), id[i]=i;
    sort(id+1,id+q+1,[&](ll x, ll y){return l[x]/S==l[y]/S?r[x]<r[y]:l[x]/S<l[y]/S;});
    L=1, R=0;
    rep(i,q)
    {
        for(;L>l[id[i]];L--)upd(L-1,+1);
        for(;R<r[id[i]];R++)upd(R+1,+1);
        for(;L<l[id[i]];L++)upd(L,-1);
        for(;R>r[id[i]];R--)upd(R,-1);
        ans[id[i]]=now;
    }
    rep(i,q)printf("%lld\n",ans[i]);
    return 0;
}