Submission #7998105


Source Code Expand

#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ppb pop_back
#define INF 1e18
typedef long long ll;

using namespace std;

int main(int argc, char *argv[])
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    ll N;
    cin >> N;
    vector<ll> a(N);
    rep(i, N) cin >> a[i];
    sort(all(a));
    vector<ll> b;

    int x;
    if(N%2==0) x = 1;
    else x = 0;
    if(N%2 != 0)b.pb(0);
    for(int i = 1;2*i-x<N;i++)
    {
        b.pb(2*i-x);
        b.pb(2*i-x);
    }

    rep(i,N)
    {
        if(a[i] != b[i])
        {
            cout<<0<<endl;
            return 0;
        }
    }

    cout << pow(2, N / 2) << endl;

    return 0;
}

Submission Info

Submission Time
Task C - Lining Up
User alter0sss
Language Python (3.4.3)
Score 0
Code Size 791 Byte
Status RE
Exec Time 17 ms
Memory 2940 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
RE × 3
RE × 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 RE 17 ms 2940 KB
sample_02.txt RE 17 ms 2940 KB
sample_03.txt RE 17 ms 2940 KB
subtask_1_invalid_01.txt RE 17 ms 2940 KB
subtask_1_invalid_02.txt RE 17 ms 2940 KB
subtask_1_max_01.txt RE 17 ms 2940 KB
subtask_1_max_02.txt RE 17 ms 2940 KB
subtask_1_max_valid_01.txt RE 17 ms 2940 KB
subtask_1_max_valid_02.txt RE 17 ms 2940 KB
subtask_1_min_valid_01.txt RE 17 ms 2940 KB
subtask_1_rand_01.txt RE 17 ms 2940 KB
subtask_1_rand_02.txt RE 17 ms 2940 KB
subtask_1_valid_01.txt RE 17 ms 2940 KB
subtask_1_valid_02.txt RE 17 ms 2940 KB