1923C - Find B - CodeForces Solution

#include<bits/stdc++.h>
#define int long long
#define sz size()
#define forx(it , a ) for(auto &it : a )
#define rep(i,x,n) for(int i=(x);i<(n);i++)
#define FOR(i,n) rep(i,1,n+1)
#define vi vector< int >
#define pii pair<int,int>
#define F first
#define all(x) x.begin(),x.end()
#define so(x) sort(all(x))
#define S second
#define cans cout<<ans<<endl;
#define endl '\n'
#define sp ' '
#define vii vector<pii>
#define yes cout<<"YES\n" ;
#define no cout<<"NO\n" ;
#define ln 2*n
#define rn 2*n+1
#define pb push_back
#define test long long t ;cin >> t ;while(t--)
using namespace std;
const int inf =  1e9 ;
const int mod=1e9+7;
const int N = 2e5 +222  ;
int dx[] = { 0, 1, 0, -1 };
int dy[] = { 0, 0, 1, 0 };
struct BIT {
	int size;
	vector<int> bit;
	BIT(int n) : size(n), bit(n + 1) {}
	void update(int x, int v) {
		x++;
		for (; x <= size; x += x & (-x)) { bit[x] += v; }
	}
	int query(int b) {
		b++;
		int result = 0;
		for (; b > 0; b -= b & (-b)) { result += bit[b]; }
		return result;
	}
};

main()
{
ios_base::sync_with_stdio(0);cin.tie(0) ;cout.tie(0);
test{

     int n , q ;
     cin >> n >> q ;
        int a[n] ; forx(it , a )cin >> it;
        int p[n+22], one [n+22] ;
     FOR(i , n ) {
          p[i] = p[i-1] + (a[i-1]) ;
          one[i] = one[i-1]+(a[i-1]==1) ;
     }
     FOR( i , q ) {
          int l , r ;
          cin >> l >> r;
          if(one[r] - one[l-1] == 0 ) {
               if(r - l + 1 == 1) {no continue;}
               yes
               continue;
          }
          if((( (p[r] - p[l - 1] ) -( r-l - (one[r] - one[l-1])+ 1)) / (one[r] - one[l-1]) ) >= 2) yes
          else no
}
}
return 0 ;
}