Pagini recente » Cod sursa (job #3323227) | Cod sursa (job #64445) | Cod sursa (job #1772173) | Cod sursa (job #3332142) | Cod sursa (job #3314274)
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
using namespace std;
ifstream fin("distincte.in");
ofstream fout("distincte.out");
const int DIM = 1e5 + 5, MOD = 666013;
int N, K, M;
int aib[DIM];
vector<set<int>> fr;
void Update(int i, int v);
int Query(int i);
int main()
{
fin >> N >> K >> M;
fr.resize(N + 1);
for (int i = 1, temp; i <= N; ++i)
{
fin >> temp;
Update(i, temp);
}
cout << aib[4] << ' ' << aib[5];
int i, j;
while (M--)
{
fin >> i >> j;
fout << Query(j) << '\n';
}
return 0;
}
void Update(int i, int v)
{
for ( ; i <= N; i += i & -i)
{
auto it = fr[i].find(v);
if (it == fr[i].end())
{
aib[i] += v;
aib[i] = aib[i] % MOD;
fr[i].insert(v);
}
}
}
int Query(int i)
{
int suma(0);
for ( ; i; i -= i & -i)
{
suma += 1LL * aib[i];
suma = suma % MOD;
}
return suma;
}