CodeForces - 86D D. Powerful array —— 莫队算法

题目链接：http://codeforces.com/problemset/problem/86/D

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

3 2
1 2 1
1 2
1 3

output

3
6

input

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

output

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.

题解：

现场做的题，结果出现了三个错误：

1.模板抄错了，原因是抄了一部分，另一部分类似，所以就复制，然后再修改，结果漏了一个地方没改，又硬是发现不了，结果卡了n久。所以以后还是老老实实地一个字符一个字符地打模板。

2.有个数组开小了，要常常注意n的范围和ai的范围。

3.把变量全部定为long long，结果超时了，而用int就过了。听说是long long的字节比较长，处理起来就相对慢了。所以以后在int范围内的变量就尽量用int定义了， 如果计算超出范围，加个：1LL*

代码如下：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <set>
#define ms(a,b) memset((a),(b),sizeof((a)))
using namespace std;
typedef long long LL;
const int INF = 2e9;
const LL LNF = 9e18;
const int mod = 1e9+7;
const int maxn = 2e5+10;

int n,m;
struct Query
{
    int L, R, id;
}node[maxn];

LL ans[maxn];

int a[maxn], num[maxn*10], unit;    //注意num[]下标的最大值为1e6
bool cmp(Query a, Query b)
{
    if(a.L/unit != b.L/unit) return a.L/unit <b.L/unit;
    else return a.R<b.R;
}

void work()
{
    LL tmp = 0;
    ms(num,0);
    int L = 1;
    int R = 0;
    for(int i = 0; i<m; i++)
    {
        while(R<node[i].R)
        {
            R++;
            tmp -= 1LL*num[a[R]]*num[a[R]]*a[R];
            num[a[R]]++;
            tmp += 1LL*num[a[R]]*num[a[R]]*a[R];
        }
        while(R>node[i].R)
        {
            tmp -= 1LL*num[a[R]]*num[a[R]]*a[R];
            num[a[R]]--;
            tmp += 1LL*num[a[R]]*num[a[R]]*a[R];
            R--;
        }

        while(L<node[i].L)
        {
            tmp -= 1LL*num[a[L]]*num[a[L]]*a[L];
            num[a[L]]--;
            tmp += 1LL*num[a[L]]*num[a[L]]*a[L];
            L++;
        }
        while(L>node[i].L)
        {
            L--;
            tmp -= 1LL*num[a[L]]*num[a[L]]*a[L];
            num[a[L]]++;
            tmp += 1LL*num[a[L]]*num[a[L]]*a[L];
        }
        ans[node[i].id] = tmp;
    }
}

int main()
{
    scanf("%d%d",&n,&m);
   for(int i = 1; i<=n; i++)
    scanf("%d",&a[i]);
    for(int i = 0; i<m; i++)
    {
        node[i].id = i;
        scanf("%d%d",&node[i].L, &node[i].R);
    }
    unit = (int)sqrt(n);
    sort(node,node+m,cmp);
    work();
    for(int i = 0; i<m; i++)
        printf("%I64d\n",ans[i]);
}