Submission #2548883
Source Code Expand
import numpy import itertools N = int(input()) A = [int(i) for i in input().split()] per = itertools.product([-1,0,1], repeat=N) ans = 0 for p in per: combined = numpy.array([x - y for (x,y) in zip(A,p)]) product = numpy.prod(combined) if product % 2 == 0: ans += 1 print(ans)
Submission Info
Submission Time | |
---|---|
Task | B - Similar Arrays |
User | kenseiQ |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 301 Byte |
Status | AC |
Exec Time | 1024 ms |
Memory | 14440 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1003 ms | 12408 KB |
02.txt | AC | 986 ms | 12408 KB |
03.txt | AC | 437 ms | 12408 KB |
04.txt | AC | 1009 ms | 12452 KB |
05.txt | AC | 1018 ms | 12408 KB |
06.txt | AC | 241 ms | 12408 KB |
07.txt | AC | 1001 ms | 14440 KB |
subtask0_0.txt | AC | 151 ms | 12408 KB |
subtask0_1.txt | AC | 150 ms | 12408 KB |
subtask0_2.txt | AC | 149 ms | 12408 KB |
subtask0_3.txt | AC | 1024 ms | 12452 KB |