Algorithm

A. Eugeny and Array
time limit per test
1 second
memory limit per test
256 megabytes
Problem link- https://codeforces.com/contest/302/problem/A
input
standard input
output
standard output

Eugeny has array a = a1, 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 li, 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 ali + 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·105). The second line contains n integers a1, a2, ..., an (ai = -1, 1). Next m lines 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.

Examples
input
Copy
2 3
1 -1
1 1
1 2
2 2
output
Copy
0
1
0
input
Copy
5 5
-1 1 1 1 -1
1 1
2 3
3 5
2 5
1 5
output
Copy
0
1
0
1
0



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <bits/stdc++.h>

using namespace std;

int const N = 2e5 + 1;
int n, m, a[N], pos, neg, l, r;

int main() {
  scanf("%d %d", &n, &m);
  for(int i = 0; i < n; ++i) {
    scanf("%d", a + i);
    if(a[i] == 1)
      ++pos;
    else
      ++neg;
  }

  for(int i = 0; i < m; ++i) {
    scanf("%d %d", &l, &r);
    int diff = r - l + 1;
    if(diff % 2 == 1)
      puts("0");
    else {
      if(diff / 2 <= pos && diff / 2 <= neg)
        puts("1");
      else
        puts("0">;
    }
  }

  return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
2 3
1 -1
1 1
1 2
2 2

Output

x
–
+
cmd
0
1
0
Advertisements

Demonstration

Codeforces Solution-Eugeny and Array-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+