Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main(){
- freopen("bcount.in", "r", stdin); freopen("bcount.out", "w", stdout);
- int n,qr; cin >> n >> qr;
- int id[n+1];
- for(int i = 1; i <= n; i++){
- cin >> id[i];
- }
- int p[n+1]; int q[n+1]; int r[n+1];
- memset(p,0,sizeof p); memset(q,0,sizeof q); memset(r,0,sizeof r);
- if(id[1] == 1){
- p[1] = 1;
- }
- else if(id[1] == 2){
- p[2] = 1;
- }
- else{
- p[3] = 1;
- }
- for(int i = 2; i <= n; i++){
- if(id[i] == 1){
- p[i] = p[i-1] + 1;
- q[i] = q[i-1]; r[i] = r[i-1];
- }
- else if(id[i] == 2){
- q[i] = q[i-1] + 1; r[i] = r[i-1]; p[i] = p[i-1];
- }
- else{
- r[i] = r[i-1] + 1; p[i] = p[i-1]; q[i] = q[i-1];
- }
- }
- while(qr--){
- int lt,rt; cin >> lt >> rt;
- cout << p[rt] - p[lt-1] << " " << q[rt] - q[lt-1] << " " << r[rt] - r[lt-1] << "\n";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement