D. Powerful array - 基础莫队

Problem - 86D - Codeforces

D. Powerful array

time limit per test

5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

An array of positive integers a1, a2, ..., an is given. Let us consider its arbitrary subarray al, al + 1..., ar, where 1 ≤ l ≤ r ≤ n. For every positive integer s denote by Ks the number of occurrences of s into the subarray. We call the power of the subarray the sum of products Ks·Ks·s for every positive integer s. The sum contains only finite number of nonzero summands as the number of different values in the array is indeed finite.

You should calculate the power of t given subarrays.

Input

First line contains two integers n and t (1 ≤ n, t ≤ 200000) — the array length and the number of queries correspondingly.

Second line contains n positive integers ai (1 ≤ ai ≤ 106) — the elements of the array.

Next t lines contain two positive integers l, r (1 ≤ l ≤ r ≤ n) each — the indices of the left and the right ends of the corresponding subarray.

Output

Output t lines, the i-th line of the output should contain single positive integer — the power of the i-th query subarray.

Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preferred to use cout stream (also you may use %I64d).

Examples

input

Copy

3 2
1 2 1
1 2
1 3

output

Copy

3
6

input

Copy

8 3
1 1 2 2 1 3 1 1
2 7
1 6
2 7

output

Copy

20
20
20

Note

Consider the following array (see the second sample) and its [2, 7] subarray (elements of the subarray are colored):

Then K1 = 3, K2 = 2, K3 = 1, so the power is equal to 32·1 + 22·2 + 12·3 = 20.

=========================================================================

 按照跟定式子求出cnt[a[i]]-->cnt[a[i]]-1时，cnt[a[i]]+1时的改变量即可，板题

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

typedef long long int  ll;

struct node
{
    int l,r,id;
};
int belong[1000000+10];
struct node s[200000+10];
ll a[1000000+10],cnt[2000000+10];
bool cmp(struct node x, struct node y)
{
    if(belong[x.l]!=belong[y.l])
        return belong[x.l]<belong[y.l];
    if(belong[x.l]&1)
        return x.r<y.r;
        return x.r>y.r;
}
ll ans=0;
void del(int pos)
{
    ans-=(cnt[a[pos]]*2ll-1)*a[pos];
    cnt[a[pos]]--;
}

void add(int pos)
{
    ans+=(cnt[a[pos]]*2ll+1)*a[pos];
    cnt[a[pos]]++;
}
ll fuck[200000+10];
int main ()
{
   int n,m;
   cin>>n>>m;

   for(int i=1;i<=n;i++)
   {
       cin>>a[i];
   }

   int siz=sqrt(n);
   int len=ceil((double)(n/siz));

   for(int i=1;i<=len;i++)
   {
       for(int j=(i-1)*siz+1;j<=i*siz;j++)
       {
           belong[j]=i;
       }
   }
   for(int i=1;i<=m;i++)
   {
       cin>>s[i].l>>s[i].r;
       s[i].id=i;
   }

   sort(s+1,s+1+m,cmp);

   int l=1,r=0;

   for(int i=1;i<=m;i++)
   {
       int nowl=s[i].l,nowr=s[i].r;

       while(l<nowl)
       {
           del(l);
           l++;
       }

       while(l>nowl)
       {
           l--;
           add(l);
       }

       while(r<nowr)
       {
           r++;
           add(r);
       }

       while(r>nowr)
       {
           del(r);
           r--;
       }

       fuck[s[i].id]=ans;
   }


   for(int i=1;i<=m;i++)
   {
       cout<<fuck[i]<<'\n';
   }
    return 0;

}