Submission #2713870
Source Code Expand
def read(): return int(input()) def readlist(): return list(map(int, input().split())) def readmap(): return map(int, input().split()) def factor(n): if n % 4 == 0: return 2 elif n % 2 == 0: return 1 else: return 0 N = read() A = readlist() fac = [factor(A[i]) for i in range(N)] num2 = fac.count(2) num1 = fac.count(1) num0 = fac.count(0) if num2 >= num0 or (num2 == num0 - 1 and num1 == 0): print("Yes") else: print("No")
Submission Info
Submission Time | |
---|---|
Task | C - 4-adjacent |
User | coro65536 |
Language | Python (3.4.3) |
Score | 400 |
Code Size | 523 Byte |
Status | AC |
Exec Time | 72 ms |
Memory | 14484 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 17 ms | 3064 KB |
0_01.txt | AC | 17 ms | 3064 KB |
0_02.txt | AC | 17 ms | 3064 KB |
0_03.txt | AC | 17 ms | 3064 KB |
0_04.txt | AC | 17 ms | 3064 KB |
1_00.txt | AC | 17 ms | 3064 KB |
1_01.txt | AC | 17 ms | 3064 KB |
1_02.txt | AC | 17 ms | 3064 KB |
1_03.txt | AC | 17 ms | 3064 KB |
1_04.txt | AC | 17 ms | 3064 KB |
1_05.txt | AC | 17 ms | 3064 KB |
1_06.txt | AC | 17 ms | 3064 KB |
1_07.txt | AC | 71 ms | 14480 KB |
1_08.txt | AC | 69 ms | 14224 KB |
1_09.txt | AC | 63 ms | 14480 KB |
1_10.txt | AC | 69 ms | 14480 KB |
1_11.txt | AC | 69 ms | 14316 KB |
1_12.txt | AC | 72 ms | 14484 KB |
1_13.txt | AC | 70 ms | 14224 KB |