Submission #1178340
Source Code Expand
#include <iostream> #include <cmath> #include <cstdlib> // rand #include <cfloat> // DBL_MAX #include <map> #include <vector> #include <algorithm> // sort #include <utility> // pair typedef long long ll; using namespace std; int main(){ ll N; cin >> N; vector<int> As(N); for(int i=0; i<N; i++){ cin >> As[i]; } ll ans=1; for(int i=1; i<N; i+=2){ ans = (ans*2) % 1000000007; } sort(As.rbegin(), As.rend()); for(int i=0; i<N; i++){ int should = (N-1) - (i/2)*2; if(As[i] != should){ ans = 0; break; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Lining Up |
User | northlander |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 641 Byte |
Status | AC |
Exec Time | 35 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 512 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 | AC | 35 ms | 640 KB |
subtask_1_max_valid_02.txt | AC | 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 | AC | 19 ms | 512 KB |
subtask_1_valid_02.txt | AC | 8 ms | 384 KB |