Submission #3607117


Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n, ans = 1;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) cin >> a.at(i);
    sort(a.begin(), a.end());
    for (int i = n - 1; i >= 0; --i) {
        if (a.at(i) != (i + n % 2) / 2 * 2 + (n - 1) % 2) {
            cout << 0 << endl;
            return 0;
        }
    }
    for (int i = 0; i < n / 2; ++i) ans *= 2;
    cout << ans << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Lining Up
User kyuko_haboro
Language C++14 (GCC 5.4.1)
Score 0
Code Size 506 Byte
Status WA
Exec Time 35 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 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 30 ms 640 KB
subtask_1_invalid_02.txt AC 7 ms 256 KB
subtask_1_max_01.txt AC 35 ms 640 KB
subtask_1_max_02.txt AC 35 ms 640 KB
subtask_1_max_valid_01.txt WA 35 ms 640 KB
subtask_1_max_valid_02.txt WA 35 ms 640 KB
subtask_1_min_valid_01.txt AC 1 ms 256 KB
subtask_1_rand_01.txt AC 21 ms 512 KB
subtask_1_rand_02.txt AC 32 ms 640 KB
subtask_1_valid_01.txt WA 19 ms 512 KB
subtask_1_valid_02.txt WA 8 ms 384 KB