Submission #2216478
Source Code Expand
from itertools import product def main(): N = int(input()) A = map(int, input().split()) f(N, A) def f2(N, A): """ Bの項どれか1つは偶数 B = A, A+1, A-1 Aの項が奇数: Bは奇数1,偶数2 Aの項が偶数: Bは奇数2,偶数1 B1が偶数なら、B2以降は似ていればなんでも良い B1が奇数なら、B2以降のどれかは似ていいるかつ偶数 全列挙しなくてもAの項の偶奇性を使ってO(N)で計算できそう """ pass def f(N, A): """全組み合わせ 3^10=59,049 """ B = [ (a, a+1, a-1) for a in A ] ans = 0 for b in product(*B): p = 1 for _b in b: p *= _b if p % 2 == 0: ans += 1 print(ans) if __name__ == '__main__': main()
Submission Info
Submission Time | |
---|---|
Task | B - Similar Arrays |
User | ksomemo |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 883 Byte |
Status | AC |
Exec Time | 66 ms |
Memory | 3064 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 | 59 ms | 3060 KB |
02.txt | AC | 66 ms | 3064 KB |
03.txt | AC | 30 ms | 3064 KB |
04.txt | AC | 61 ms | 3064 KB |
05.txt | AC | 61 ms | 3060 KB |
06.txt | AC | 22 ms | 3060 KB |
07.txt | AC | 61 ms | 3064 KB |
subtask0_0.txt | AC | 17 ms | 3064 KB |
subtask0_1.txt | AC | 18 ms | 3064 KB |
subtask0_2.txt | AC | 17 ms | 3060 KB |
subtask0_3.txt | AC | 61 ms | 3060 KB |