DataStructure/SqrtDecomposition/Mo/test2.cpp

• View this file on GitHub
• Last update: 2025-06-07 22:48:02+07:00
• Link: https://codeforces.com/contest/86/problem/D

Depends on

• template.h

Code

// https://codeforces.com/contest/86/problem/D

#include "../../../template.h"

int block_sz;
vector<int> a;

struct Query{
    int l, r, idx;
};

vector<Query> q;

bool cmp(Query a, Query b){
    if(a.l/block_sz != b.l/block_sz)
        return a.l/block_sz < b.l/block_sz;
    return a.r < b.r;
}

vector<int> fre;
ll sum = 0;

void insert(int i) {
    sum += (2*fre[a[i]]+1)*a[i];
    fre[a[i]]++;
}

void remove(int i) {
    sum -= (2*fre[a[i]]-1)*a[i];
    fre[a[i]]--;
}

vector<ll> query(){
    sort(q.begin(), q.end(), cmp);
    int curL = 0, curR = 0;
    fre.resize(1e6+1, 0);
    vector<ll> ans((int)q.size());
    for(int i = 0; i < (int)q.size(); i++){
        auto [L, R, idx] = q[i];
        while(curL < L) remove(curL++);
        while(curL > L) insert(--curL);
        while(curR <= R) insert(curR++);
        while(curR > R+1) remove(--curR);
        ans[idx] = sum;
    }
    return ans;
}

void solve(){
    int n, t; cin >> n >> t;
    a.resize(n);
    for(int i = 0; i < n; i++)
        cin >> a[i];
    for(int i = 0; i < t; i++){
        int l, r; cin >> l >> r;
        q.push_back({l-1, r-1, i});
    }
    block_sz = sqrt(n);
    vector<ll> ans = query();
    for(ll x : ans) cout << x << '\n';
}

#line 1 "DataStructure/SqrtDecomposition/Mo/test2.cpp"
// https://codeforces.com/contest/86/problem/D

#line 2 "template.h"

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define MOD (ll)(1e9+7)
#define all(x) (x).begin(),(x).end()
#define unique(x) x.erase(unique(all(x)), x.end())
#define INF32 ((1ull<<31)-1)
#define INF64 ((1ull<<63)-1)
#define inf (ll)1e18

#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

const int mod = 998244353;

void solve();

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // cin.exceptions(cin.failbit);
    // int t; cin >> t;
    // while(t--)
        solve();
    cerr << "\nTime run: " << 1000 * clock() / CLOCKS_PER_SEC << "ms" << '\n';
    return 0;
}
#line 4 "DataStructure/SqrtDecomposition/Mo/test2.cpp"

int block_sz;
vector<int> a;

struct Query{
    int l, r, idx;
};

vector<Query> q;

bool cmp(Query a, Query b){
    if(a.l/block_sz != b.l/block_sz)
        return a.l/block_sz < b.l/block_sz;
    return a.r < b.r;
}

vector<int> fre;
ll sum = 0;

void insert(int i) {
    sum += (2*fre[a[i]]+1)*a[i];
    fre[a[i]]++;
}

void remove(int i) {
    sum -= (2*fre[a[i]]-1)*a[i];
    fre[a[i]]--;
}

vector<ll> query(){
    sort(q.begin(), q.end(), cmp);
    int curL = 0, curR = 0;
    fre.resize(1e6+1, 0);
    vector<ll> ans((int)q.size());
    for(int i = 0; i < (int)q.size(); i++){
        auto [L, R, idx] = q[i];
        while(curL < L) remove(curL++);
        while(curL > L) insert(--curL);
        while(curR <= R) insert(curR++);
        while(curR > R+1) remove(--curR);
        ans[idx] = sum;
    }
    return ans;
}

void solve(){
    int n, t; cin >> n >> t;
    a.resize(n);
    for(int i = 0; i < n; i++)
        cin >> a[i];
    for(int i = 0; i < t; i++){
        int l, r; cin >> l >> r;
        q.push_back({l-1, r-1, i});
    }
    block_sz = sqrt(n);
    vector<ll> ans = query();
    for(ll x : ans) cout << x << '\n';
}

Back to top page