Submission #1217245
Source Code Expand
#include <cstdio> #include <cstring> #include <vector> #include <queue> #include <string> #include <algorithm> #include <iostream> #include <string> #include <map> #include <set> #include <functional> #include <iostream> #define MOD 1000000007LL using namespace std; typedef long long ll; typedef pair<int,int> P; int n; int a[100001]; int cnt[100001]; int main(void){ scanf("%d",&n); for(int i=0;i<n;i++){ scanf("%d",&a[i]); cnt[a[i]]++; } ll res=1; for(int i=n-1;i>=0;i-=2){ if(i==0){ if(cnt[i]==1)res=res; else res=0; }else{ if(cnt[i]==2)res=res*2LL%MOD; else res=0; } } for(int i=n-2;i>=0;i-=2){ if(cnt[i]!=0)res=0; } printf("%lld\n",res); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Lining Up |
User | ryoissy |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 735 Byte |
Status | AC |
Exec Time | 11 ms |
Memory | 1024 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:23:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:25:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&a[i]); ^
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 | 9 ms | 896 KB |
subtask_1_invalid_02.txt | AC | 3 ms | 384 KB |
subtask_1_max_01.txt | AC | 11 ms | 1024 KB |
subtask_1_max_02.txt | AC | 11 ms | 1024 KB |
subtask_1_max_valid_01.txt | AC | 11 ms | 1024 KB |
subtask_1_max_valid_02.txt | AC | 11 ms | 1024 KB |
subtask_1_min_valid_01.txt | AC | 1 ms | 256 KB |
subtask_1_rand_01.txt | AC | 7 ms | 768 KB |
subtask_1_rand_02.txt | AC | 10 ms | 1024 KB |
subtask_1_valid_01.txt | AC | 6 ms | 640 KB |
subtask_1_valid_02.txt | AC | 3 ms | 384 KB |