# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
136948 | dnass | Poklon (COCI17_poklon) | C++14 | 374 ms | 632 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;
int n, q;
int a[5010];
int main(){
scanf("%d %d", &n, &q);
for(int i=0;i<n;i++) scanf("%d", &a[i]);
while(q--){
int l, r; scanf("%d %d", &l, &r);
--l; --r;
vector<int> x;
for(int i=l;i<=r;i++) x.push_back(a[i]);
sort(x.begin(), x.end());
int beg = 0, ans = 0;
for(int i=1;i<=(int) x.size();i++){
if(i==(int) x.size()||x[i]!=x[i-1]){
if(i-beg==2) ans++;
beg = i;
}
}
printf("%d\n", ans);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |