Advertisement
Guest User

Untitled

a guest
Dec 15th, 2021
184
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.83 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int main(){
  5.     freopen("bcount.in", "r", stdin);   freopen("bcount.out", "w", stdout);
  6.     int n,qr; cin >> n >> qr;
  7.     int id[n+1];
  8.     for(int i = 1; i <= n; i++){
  9.         cin >> id[i];
  10.     }
  11.     int p[n+1]; int q[n+1]; int r[n+1];
  12.     memset(p,0,sizeof p); memset(q,0,sizeof q); memset(r,0,sizeof r);
  13.     if(id[1] == 1){
  14.         p[1] = 1;
  15.     }
  16.     else if(id[1] == 2){
  17.         p[2] = 1;
  18.     }
  19.     else{
  20.         p[3] = 1;
  21.     }
  22.     for(int i = 2; i <= n; i++){
  23.         if(id[i] == 1){
  24.             p[i] = p[i-1] + 1;
  25.             q[i] = q[i-1]; r[i] = r[i-1];
  26.         }
  27.         else if(id[i] == 2){
  28.             q[i] = q[i-1] + 1; r[i] = r[i-1]; p[i] = p[i-1];
  29.         }
  30.         else{
  31.             r[i] = r[i-1] + 1; p[i] = p[i-1]; q[i] = q[i-1];
  32.         }
  33.     }
  34.     while(qr--){
  35.         int lt,rt; cin >> lt >> rt;
  36.         cout << p[rt] - p[lt-1] << " " << q[rt] - q[lt-1] << " " << r[rt] - r[lt-1] << "\n";
  37.     }
  38.     return 0;
  39. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement