Submission #1693585


Source Code Expand

#include<bits/stdc++.h>

// Shrotening
#define fst first
#define snd second
#define pb push_back

// Loop
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define RFOR(i,a,b) for(long i=(a);i>=(b);--i)

#define REP(i,a) for(long i=0;i<(a);++i)
#define RREP(i,a) for(long i=(a);i>=0;--i)

#define EACH(i,a) for(auto (i)=(a).begin(),_END=(a).end();i!=_END;++i)
#define REACH(i,a) for(auto (i)=(a).rbegin(),_END=(a).rend();i!=_END;++i)

//Algorithm
#define ALL(a) (a).begin(), a.end()
#define RALL(a) (a).rbegin(), a.rend()
#define EXIST(a,x) ((a).find(x)!=(a).end())
#define SORT(a) std::sort((a).begin(), (a).end())
#define UNIQUE(a) std::sort((a).begin(), a.end()), a.erase(std::unique((a).begin(), a.end()), a.end());
#define SUM(a) std::accumulate((a).begin(), (a).end(), 0);

//Setting
#define OPT std::cin.tie(0);std::ios::sync_with_stdio(false);

//debug message
bool debug = true;
#define MSG(s)   if(debug){std::cout << s << std::endl;}
#define DEBUG(x) if(debug){std::cout << "debug(" << #x << "): " << x << std::endl;}

//alias
typedef long long LL;
typedef std::vector<char> VC;
typedef std::vector<int>  VI;
typedef std::vector<long> VL;
typedef std::vector<long long> VLL;

typedef std::vector< VC > VC2;
typedef std::vector< VI > VI2;
typedef std::vector< VL > VL2;
typedef std::vector< VLL > VLL2;

typedef std::pair<int,int> PII;

const LL MOD = 1e9 + 7;

int N;
int main() {
    std::cin >> N;
    std::vector<int> mp(N/2 + (N%2 != 0), 0);
    REP(i, N) {
        int A;
        std::cin >> A;
        mp[A/2]++;
    }
    if(N % 2 != 0) {
        mp[0]++;
    }
    if(std::count_if(ALL(mp), [](int x){return x == 2;}) == mp.size()) {
        int ans = 1;
        REP(i, N/2) {
            ans = (ans*2) % MOD;
        }
        std::cout << ans << std::endl;
    } else {
        std::cout << 0 << std::endl;
    }
}

Submission Info

Submission Time
Task C - Lining Up
User b1464296
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1900 Byte
Status AC
Exec Time 29 ms
Memory 384 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 25 ms 384 KB
subtask_1_invalid_02.txt AC 6 ms 256 KB
subtask_1_max_01.txt AC 29 ms 384 KB
subtask_1_max_02.txt AC 29 ms 384 KB
subtask_1_max_valid_01.txt AC 29 ms 384 KB
subtask_1_max_valid_02.txt AC 29 ms 384 KB
subtask_1_min_valid_01.txt AC 1 ms 256 KB
subtask_1_rand_01.txt AC 18 ms 384 KB
subtask_1_rand_02.txt AC 27 ms 384 KB
subtask_1_valid_01.txt AC 16 ms 384 KB
subtask_1_valid_02.txt AC 7 ms 256 KB