Submission #1352685
Source Code Expand
from collections import * n=input() a=Counter(map(int,raw_input().split())) s=1 if n&1: if 0 not in a or a[0]>1: print 0 exit(0) s+=1 while s<n: if s not in a or a[s]!=2: print 0 exit(0) s+=2 print pow(2,n/2,10**9+7)
Submission Info
Submission Time | |
---|---|
Task | C - Lining Up |
User | Yash |
Language | Python (2.7.6) |
Score | 300 |
Code Size | 278 Byte |
Status | AC |
Exec Time | 94 ms |
Memory | 11444 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 | 17 ms | 2936 KB |
sample_02.txt | AC | 12 ms | 2808 KB |
sample_03.txt | AC | 12 ms | 2808 KB |
subtask_1_invalid_01.txt | AC | 67 ms | 10124 KB |
subtask_1_invalid_02.txt | AC | 24 ms | 4648 KB |
subtask_1_max_01.txt | AC | 77 ms | 11444 KB |
subtask_1_max_02.txt | AC | 87 ms | 11444 KB |
subtask_1_max_valid_01.txt | AC | 93 ms | 11444 KB |
subtask_1_max_valid_02.txt | AC | 94 ms | 11444 KB |
subtask_1_min_valid_01.txt | AC | 12 ms | 2808 KB |
subtask_1_rand_01.txt | AC | 56 ms | 9076 KB |
subtask_1_rand_02.txt | AC | 71 ms | 10848 KB |
subtask_1_valid_01.txt | AC | 56 ms | 8804 KB |
subtask_1_valid_02.txt | AC | 28 ms | 4720 KB |