Submission #917414

#TimeUsernameProblemLanguageResultExecution timeMemory
91741412345678Poklon (COCI17_poklon)C++17
140 / 140
943 ms24540 KiB
#include <bits/stdc++.h> using namespace std; const int nx=5e5+5, rx=720; int n, q, v[nx], cnt[nx], t, l, r, rt, ans[nx], res; map<int, int> mp; vector<tuple<int, int, int>> d[rx]; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n>>q; for (int i=1; i<=n; i++) cin>>v[i], mp[v[i]]=0; for (auto &[x, y]:mp) y=++t; for (int i=1; i<=n; i++) v[i]=mp[v[i]]; rt=sqrt(n)+1; for (int i=1; i<=q; i++) cin>>l>>r, d[r/rt].push_back({l, r, i}); for (int i=0 ; i<=rt; i++) { sort(d[i].begin(), d[i].end()); l=1; r=0; for (auto [cl, cr, idx]:d[i]) { while (r<cr) r++, res-=(cnt[v[r]]==2), cnt[v[r]]++, res+=(cnt[v[r]]==2); while (r>cr) res-=(cnt[v[r]]==2), cnt[v[r]]--, res+=(cnt[v[r]]==2), r--; while (l<cl) res-=(cnt[v[l]]==2), cnt[v[l]]--, res+=(cnt[v[l]]==2), l++; while (l>cl) l--, res-=(cnt[v[l]]==2), cnt[v[l]]++, res+=(cnt[v[l]]==2); //cout<<cl<<' '<<cr<<' '<<res<<' '<<cnt[1]<<'\n'; ans[idx]=res; } for (int j=1; j<=n; j++) cnt[j]=res=0; } for (int i=1; i<=q; i++) cout<<ans[i]<<'\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...