Submission #7998190

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <string>

//ranker
using namespace std;

#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n) DEPS(i, n, 0)


int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;
  cin >> N;

  int N2, N0;
  N2 = N/2;
  N0 = N%2;

  int A[N];

  int c[N]={0};
  int temp;
  REP(i, N){
  cin >> temp;
  c[temp]++;
}

  int ans = 0;
  if(N0==0){
    for(int i=1; i<N; i += 2){
      if(c[i] != 2){
        cout << 0 << endl;
        return 0;
      }
    }
  }

  if(N0==1){
      if(c[0] != 1){
        cout << 0 << endl;
        return 0;
      }
    for(int i=2; i<N; i += 2){
      if(c[i] != 2){
        ans = 0;
        cout << 0 << endl;
        return 0;
      }
    }
  }


  long long int tot = 1;
  REP(i, N2) (tot *= 2) %= 1000000000+7;
  cout << tot << endl;

  return 0;
}

Submission Info

Judge Result