Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.007 s | 0 KBi |
#2 |
Correcto
|
0.003 s | 0 KBi |
#3 |
Correcto
|
0.009 s | 6 KBi |
#4 |
Correcto
|
0.403 s | 6 KBi |
#5 |
Correcto
|
0.379 s | 7 KBi |
#6 |
Correcto
|
0.807 s | 29 KBi |
#7 |
Correcto
|
0.779 s | 19 KBi |
#8 |
Tiempo límite excedido
|
1.063 s | 24 KBi |
/// Write by Daniel Perez .PERAPRO #include<bits/stdc++.h> using namespace std; #define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define pb push_back #define ff first #define ss second typedef long long ll; typedef unsigned long long ull; typedef long double ld; using vi=vector<int>; using vl=vector<ll>; using pii=pair<int,int>; char el = '\n'; char esp = ' '; template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } ostream& operator<<(ostream& os, const vector<int> &v){ for(auto const &i: v){ os<<i<<" "; } os<<'\n'; return os; } string yes="YES"; string no="NO"; int main(){ fast_io; /* freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); */ int n; cin>>n; vi v(n); map<int,int> cnt; map<int,set<pii>> solve; for(int i=0;i<n;i++){ cin>>v[i]; } for(int i=0;i<n;i++){ cnt[v[i]]++; solve[v[i]].insert({i,cnt[v[i]]}); } int querys,l,r,x; cin>>querys; while(querys--){ cin>>l>>r>>x; auto it = solve[x].lower_bound({l,0}); if(it == solve[x].end() || it->ff > r){ // Hay al menos un elemento en el rango [l, r] cout<<0<<el; continue; } pii left = *it; it = solve[x].lower_bound({r,0}); if(it == solve[x].end() || it->ff > r) it--; pii right = *it; cout<<right.ss - left.ss + 1<<el; } } /* */