Submission #1112939

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <iostream>
#include <set>
#include <map>
using namespace std;
typedef long long ll;

int N;
int A[100005];

int main(int argc, char const *argv[]) {
	cin >> N;
	vector<int> v(N);

	for (int i = 0; i < N; i++) {
		cin >> v[i];
	}
	sort(v.begin(), v.end());

	if (N % 2 == 0) {
		int check = 1;
		for (int i = 0; i < N; i++) {
			if (i % 2 == 0 && v[i] == check) {
				continue;
			}
			else if (i % 2 == 1 && v[i] == check) {
				check += 2;
				continue;
			}
			else {
				cout << "0" << endl;
				return 0;
			}
		}
		cout << (int)pow(2, N / 2) << endl;	
	}

	else {
		if (v[0] != 0) {
			cout << "0" << endl;
			return 0;
		}
		int check = 2;
		for (int i = 1; i < N; i++) {
			if (i % 2 == 1 && v[i] == check) {
				continue;
			}
			else if (i % 2 == 0 && v[i] == check) {
				check += 2;
				continue;
			}
			else {
				cout << "0" << endl;
				return 0;
			}
		}
		cout << (int)pow(2, (N-1) / 2) << endl;
	}
	
	return 0;
}

Submission Info

Judge Result