# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
479652 | aris12345678 | Poklon (COCI17_poklon) | C++14 | 5072 ms | 14104 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define X first
#define Y second
const int mxN = 500005;
const int block = 800;
int cnt = 0;
int a[mxN];
unordered_map<int, int> mp;
struct Q {
int X, Y, pos;
};
bool comp(Q a, Q b) {
if(a.X/block != b.X/block)
return a.X/block < b.X/block;
return a.Y < b.Y;
}
void add(int p) {
if(mp[a[p]] == 2)
cnt--;
mp[a[p]]++;
if(mp[a[p]] == 2)
cnt++;
}
void remove(int p) {
if(mp[a[p]] == 2)
cnt--;
mp[a[p]]--;
if(mp[a[p]] == 2)
cnt++;
}
int main() {
int n, q;
scanf("%d %d", &n, &q);
mp.rehash(n);
for(int i = 1; i <= n; i++)
scanf("%d", &a[i]);
vector<Q> queries;
for(int i = 0; i < q; i++) {
int l, r;
scanf("%d %d", &l, &r);
queries.push_back({l, r, i});
}
sort(queries.begin(), queries.end(), comp);
vector<int> ans(q);
int ml = 1, mr = 0;
for(int i = 0; i < q; i++) {
int l = queries[i].X, r = queries[i].Y;
while(ml > l) {
ml--;
add(ml);
}
while(mr < r) {
mr++;
add(mr);
}
while(ml < l) {
remove(ml);
ml++;
}
while(mr > r) {
remove(mr);
mr--;
}
ans[queries[i].pos] = cnt;
}
for(int i = 0; i < q; i++)
printf("%d\n", ans[i]);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |