/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 15ms 2.941 MiB
#2 Accepted 15ms 2.891 MiB
#3 Wrong Answer 14ms 3.113 MiB
#4 Accepted 14ms 3.102 MiB
#5 Wrong Answer 14ms 3.02 MiB
#6 Accepted 14ms 3.113 MiB
#7 Accepted 14ms 2.926 MiB
#8 Accepted 14ms 3.109 MiB
#9 Wrong Answer 60ms 12.262 MiB
#10 Accepted 62ms 12.086 MiB
#11 Wrong Answer 60ms 12.148 MiB
#12 Wrong Answer 14ms 3.02 MiB
#13 Wrong Answer 14ms 3.09 MiB
#14 Wrong Answer 47ms 4.75 MiB
#15 Wrong Answer 48ms 4.746 MiB
#16 Wrong Answer 50ms 4.906 MiB

Code

#Fahmi_Nafi_46

n = int(input())
x = list(map(int, input().split()))
count = 0
odd = 0

for i in range(n):
    if x[i] % 2 == 0:
        count += 1
    else:
        odd += 1
if odd % 2 != 0:
    print(-1)
else:
    print(count+1)

Information

Submit By
Type
Submission
Problem
P1042 Array partition
Contest
TLE_Headquarters - round #1
Language
Python 3 (Python 3.12.3)
Submit At
2024-03-27 16:49:29
Judged At
2024-10-03 13:56:25
Judged By
Score
40
Total Time
62ms
Peak Memory
12.262 MiB