Cod sursa(job #36683)

Utilizator dominoMircea Pasoi domino Data 23 martie 2007 23:04:52
Problema Distincte Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.62 kb
#include <stdio.h>
#include <algorithm>

using namespace std;

#define MAX_N 100005
#define MAX_Q 100005
#define MOD 666013
#define FIN "distincte.in"
#define FOUT "distincte.out"
#define FOR(i, a, b) for (i = (a); i < (b); i++)
#define f first
#define s second
#define mp make_pair
#define LSB(x) (((x) & ((x)-1)) ^ (x))
#define ADD(x, y) if (((x) += (y)) >= MOD) (x) -= MOD

int N, K, Q, A[MAX_N], S[MAX_N], T[MAX_N], last[MAX_N], query_ans[MAX_Q]; char U[MAX_N];
pair<pair<int, int>, int> query[MAX_Q];

void set(int l, int r, int val)
{
    if (!r) return;
    r++;
    for (; l <= N; l += LSB(l)) ADD(T[l], val);
    val = MOD-val;
    for (; r <= N; r += LSB(r)) ADD(T[r], val);
}

int get(int x)
{
    int ret = 0;
    
    for (; x > 0; x -= LSB(x))
        ADD(ret, T[x]);
    return ret;
}

int main(void)
{
    int i, j, l, r, ret;
    
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);

    scanf("%d %d %d", &N, &K, &Q);
    FOR (i, 1, N+1)
    {
        scanf("%d", A+i);
        S[i] = S[i-1];
        if (!U[A[i]]) ADD(S[i], A[i]);
        U[A[i]] = 1;
    }
    FOR (i, 0, Q)
    {
        scanf("%d %d", &l, &r);
        query[i] = mp(mp(r, l), i);
    }

    sort(query, query+Q);
    for (i = 0, j = 1; i < Q; i++)
    {
        l = query[i].f.s, r = query[i].f.f;
        for (; j <= r && j <= N; j++)
        {
            if (last[A[j]]) set(last[A[j]], j-1, MOD-A[j]);
            set(j, j, (get(j-1) + A[j]) % MOD);
            last[A[j]] = j;
        }
        ret = (S[r] + MOD - get(l-1)) % MOD;
        query_ans[query[i].s] = ret;
    }

    FOR (i, 0, Q)
        printf("%d\n", query_ans[i]);
    
    return 0;
}