Submission #3612564
Source Code Expand
#include <cstdio> #include <cmath> #define MOD 1000000007 int powermod(int num,int exp){ if(exp == 0) return 1; int ret = 1; for(int i = 1;i <= exp;i++){ ret *= num; if(ret >= MOD) ret %= MOD; } return ret; } int main(){ int cnt[100002] = {}; int N; scanf("%d",&N); int a; for(int i = 0;i < N;i++){ scanf("%d",&a); cnt[a]++; } int long long ans = powermod(2,N / 2); bool flag = false; for(int i = 1;i < N;i++){ if( cnt[i] != 2 && cnt[i] != 0){ flag = true; } } if(flag){ puts("0"); } else{ printf("%lld\n",ans % MOD); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Lining Up |
User | noob0828 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 652 Byte |
Status | AC |
Exec Time | 10 ms |
Memory | 512 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:17:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&N); ^ ./Main.cpp:20:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&a); ^
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 | 512 KB |
sample_02.txt | AC | 1 ms | 512 KB |
sample_03.txt | AC | 1 ms | 512 KB |
subtask_1_invalid_01.txt | AC | 9 ms | 512 KB |
subtask_1_invalid_02.txt | AC | 2 ms | 512 KB |
subtask_1_max_01.txt | AC | 10 ms | 512 KB |
subtask_1_max_02.txt | AC | 10 ms | 512 KB |
subtask_1_max_valid_01.txt | AC | 10 ms | 512 KB |
subtask_1_max_valid_02.txt | AC | 10 ms | 512 KB |
subtask_1_min_valid_01.txt | AC | 1 ms | 512 KB |
subtask_1_rand_01.txt | AC | 6 ms | 512 KB |
subtask_1_rand_02.txt | AC | 9 ms | 512 KB |
subtask_1_valid_01.txt | AC | 6 ms | 512 KB |
subtask_1_valid_02.txt | AC | 3 ms | 512 KB |