Eugeny and Array

Eugeny and Arraytime limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Eugeny has array a = a_{1, a2, ..., an,
consisting of n integers. Each integer ai equals
to -1, or to 1. Also, he has m queries:}

• Query number i is given as a pair of integers l_{i, ri (1 ≤ li ≤ ri ≤ n).}
• The response to the query will be integer 1, if the elements of array a can
  be rearranged so as the sum a_{li + ali + 1 + ... + ari = 0,
  otherwise the response to the query will be integer 0.}

Help Eugeny, answer all his queries.

Input

The first line contains integers n and m (1 ≤ n, m ≤ 2·10^{5).
The second line contains n integers a_{1, a2, ..., an (ai = -1, 1).
Next mlines contain Eugene's queries. The i-th line
contains integers li, ri (1 ≤ li ≤ ri ≤ n).}}

Output

Print m integers — the responses to Eugene's queries in the order they occur in the input.

Sample test(s)input

2 31 -11 11 22 2

output

010

input

5 5-1 1 1 1 -11 12 33 52 51 5

output

01010

思路:詢問的的長度是  -1的1的最少數的2倍以內則可以.

#include <algorithm>#include <iostream>#include <iomanip>#include <cstdio>#include <cmath>#include <cstdlib>#include <cstring>typedef long long ll;#defineclr(a)memset((a),0,sizeof (a))#definerep(i,a,b)for(int i=(a);i<(int)(b);i++)#defineper(i,a,b)for(int i=((a)-1);i>=(int)(b);i--)#defineinf0x7ffffff#defineeps1e-6using namespace std;int n,m; int a[200005];int main(){int n,m;int fu=0,zhen=0;cin>>n>>m;int ai;for(int i=0;i<n;i++){   cin>>ai;       if(ai<0)      fu++;   else zhen++;    }int maxn=min(fu,zhen); int p,q; while(m--){   cin>>p>>q;   int cnt=q-p+1;   if(cnt&1)cout<<0<<endl;   else if((cnt/2)>maxn)cout<<0<<endl;   else cout<<1<<endl;           }  //system("pause");  return 0;}