# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
402050 | keta_tsimakuridze | Poklon (COCI17_poklon) | C++14 | 1653 ms | 41740 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>
#define f first
#define int long long
#define s second
using namespace std;
const int N=5e5+5,mod=1e9+7;
int t,n,q,a[N],tree[N],bef[N],ans[N];
map<int,int>pos;
string s;
vector<pair<int,int> >V[N];
void update(int ind,int val){
for(ind;ind<=n;ind+=ind&(-ind)) tree[ind]+=val;
}
int getans(int ind){
int pas=0;
for(ind;ind>=1;ind-=ind&(-ind)) pas+=tree[ind];
return pas;
}
main(){
// t=1;
cin>>n>>q;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=q;i++){
int l,r;
cin>>l>>r;
V[l].push_back({r,i});
}
for(int i=n;i>=1;i--){
bef[i]=pos[a[i]];
if(bef[bef[i]] ) update(bef[bef[i]],-2);
if(bef[bef[bef[i]]]) update(bef[bef[bef[i]]],1);
if(bef[i])update(bef[i],1);
for(int j=0;j<V[i].size();j++){
ans[V[i][j].s] = getans(V[i][j].f);
}
pos[a[i]] = i;
}
for(int i=1;i<=q;i++) cout<<ans[i]<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |