Submission #1188751

#TimeUsernameProblemLanguageResultExecution timeMemory
1188751_dtq_Poklon (COCI17_poklon)C++17
84 / 140
5094 ms10912 KiB
#include<bits/stdc++.h> #define ll long long #define fi first #define se second #define pb push_back #define all(v) v.begin(), v.end() #define sz(x) (long long)(x.size()) using namespace std; const ll N = 5e5 + 9; ll n, q, i, a[N], dem[N]; vector<ll>vec; int main() { cin.tie(0)->sync_with_stdio(0); cin >> n >> q; for( i = 1; i <= n; i ++ ) { cin >> a[i]; vec.pb(a[i]); } sort(all(vec)); for( i = 1; i <= n; i ++ ) a[i] = lower_bound(all(vec), a[i]) - vec.begin(); for( i = 1; i <= q; i ++ ) { ll l, r; cin >> l >> r; for( int w = l; w <= r; w ++ ) dem[a[w]] ++; ll ans = 0; for( int w = l; w <= r; w ++ ) { ans += (dem[a[w]] == 2); dem[a[w]] = 0; } cout << ans << "\n"; } return 0; } /* */
#Verdict Execution timeMemoryGrader output
Fetching results...