Submission #1111350


Source Code Expand

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define INF 0x3f3f3f3f
#define MOD 1000000007
using namespace std;
int dx[4]={0,0,-1,1};
int dy[4]={-1,1,0,0};

int main(){
	int N,a;
	int A[100000]={};
	cin>>N;
	for(int i=N-1;i>=0;i-=2){
		//printf("%d\n",i);
		A[i]+=2;
	}
	if(N%2)
		A[0]--;
	for(int i=0;i<N;i++){
		cin>>a;
		A[a]--;
	}
	bool flag=0;
	for(int i=0;i<100000;i++)
		if(A[i])
			flag=1;
	if(flag)
		cout<<"0"<<endl;
	else{
		long long ans=1;
		int pow=N/2;
		for(int i=0;i<pow;i++)
			ans*=2;
		cout<<ans<<endl;
	}
	return 0;
}

Submission Info

Submission Time
Task C - Lining Up
User takeo1116
Language C++14 (GCC 5.4.1)
Score 0
Code Size 773 Byte
Status WA
Exec Time 37 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 10
WA × 4
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_invalid_01.txt, subtask_1_invalid_02.txt, subtask_1_max_01.txt, subtask_1_max_02.txt, subtask_1_max_valid_01.txt, subtask_1_max_valid_02.txt, subtask_1_min_valid_01.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_valid_01.txt, subtask_1_valid_02.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 640 KB
sample_02.txt AC 2 ms 640 KB
sample_03.txt AC 2 ms 640 KB
subtask_1_invalid_01.txt AC 30 ms 640 KB
subtask_1_invalid_02.txt AC 7 ms 640 KB
subtask_1_max_01.txt AC 36 ms 640 KB
subtask_1_max_02.txt AC 36 ms 640 KB
subtask_1_max_valid_01.txt WA 36 ms 640 KB
subtask_1_max_valid_02.txt WA 37 ms 640 KB
subtask_1_min_valid_01.txt AC 2 ms 640 KB
subtask_1_rand_01.txt AC 22 ms 640 KB
subtask_1_rand_02.txt AC 34 ms 640 KB
subtask_1_valid_01.txt WA 20 ms 640 KB
subtask_1_valid_02.txt WA 8 ms 640 KB