Submission #3601811


Source Code Expand

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
main(){
    int N;
    cin >> N;
    int table[N+1] = {};
    rep(i,0,N){
        int x;
        cin >> x;
        table[x]++;
    }
    ll ans = 1;
    rep(i,0,N/2){
        ans = (ans * 2 % MOD);
    }
    rep(i,0,N+1){
        //奇数
        if(N % 2){
            if((i % 2 == 0 && i != 0) && table[i] != 2 ||
               i == 0 && table[0] != 1){
                   ans = 0;
               }
        }else{
            if(i % 2 == 1 && table[i] != 2){
                ans = 0;
            }
        }
    }
    cout << ans << endl;
}

Submission Info

Submission Time
Task C - Lining Up
User Bantako
Language C++14 (GCC 5.4.1)
Score 300
Code Size 737 Byte
Status AC
Exec Time 39 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 14
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 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_invalid_01.txt AC 32 ms 512 KB
subtask_1_invalid_02.txt AC 7 ms 256 KB
subtask_1_max_01.txt AC 37 ms 640 KB
subtask_1_max_02.txt AC 39 ms 640 KB
subtask_1_max_valid_01.txt AC 37 ms 640 KB
subtask_1_max_valid_02.txt AC 37 ms 640 KB
subtask_1_min_valid_01.txt AC 1 ms 256 KB
subtask_1_rand_01.txt AC 23 ms 512 KB
subtask_1_rand_02.txt AC 35 ms 640 KB
subtask_1_valid_01.txt AC 21 ms 512 KB
subtask_1_valid_02.txt AC 8 ms 384 KB