Submission #1238811
Source Code Expand
import java.util.Scanner; public class Main{ private static final Scanner s=new Scanner(System.in); public static void main(String[] args){ int n=s.nextInt(),a[]=new int[n]; for(int i=0;i<n;i++) a[s.nextInt()]++; if(n%2==0) { for(int i=1;i<n;i+=2) { if(a[i]!=2) { System.out.println(0); return; } } System.out.println(1<<n/2); }else { if(a[0]!=1) { System.out.println(0); return; } for(int i=2;i<n;i+=2) { if(a[i]!=2) { System.out.println(0); return; } } System.out.println(1<<n/2); } } }
Submission Info
Submission Time | |
---|---|
Task | C - Lining Up |
User | fal_rnd |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 609 Byte |
Status | WA |
Exec Time | 435 ms |
Memory | 49444 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 92 ms | 20560 KB |
sample_02.txt | AC | 94 ms | 21712 KB |
sample_03.txt | AC | 91 ms | 20692 KB |
subtask_1_invalid_01.txt | AC | 400 ms | 49444 KB |
subtask_1_invalid_02.txt | AC | 238 ms | 37504 KB |
subtask_1_max_01.txt | AC | 421 ms | 48376 KB |
subtask_1_max_02.txt | AC | 435 ms | 46672 KB |
subtask_1_max_valid_01.txt | WA | 402 ms | 47648 KB |
subtask_1_max_valid_02.txt | WA | 433 ms | 47340 KB |
subtask_1_min_valid_01.txt | AC | 93 ms | 20692 KB |
subtask_1_rand_01.txt | AC | 349 ms | 46904 KB |
subtask_1_rand_02.txt | AC | 396 ms | 48876 KB |
subtask_1_valid_01.txt | WA | 349 ms | 47900 KB |
subtask_1_valid_02.txt | WA | 244 ms | 37668 KB |