/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 22ms 2.906 MiB
#2 Accepted 21ms 3.121 MiB
#3 Accepted 22ms 2.992 MiB
#4 Accepted 22ms 3.125 MiB
#5 Accepted 22ms 3.062 MiB
#6 Accepted 22ms 3.008 MiB
#7 Accepted 22ms 3.051 MiB
#8 Accepted 20ms 3.121 MiB
#9 Wrong Answer 125ms 16.258 MiB
#10 Accepted 91ms 12.297 MiB
#11 Wrong Answer 124ms 16.266 MiB
#12 Wrong Answer 22ms 3.125 MiB
#13 Wrong Answer 21ms 2.891 MiB
#14 Wrong Answer 70ms 4.824 MiB
#15 Wrong Answer 73ms 4.742 MiB
#16 Wrong Answer 70ms 4.754 MiB

Code

n = int(input())
x = list(map(int, input().split()))
count = 0
odd = 0
new = []
for i in range(n):
    if x[i] % 2 != 0:
        odd += 1
if odd % 2 != 0:
    print(-1)
else:
    z = set(x)
    for i in z:
        if i % 2 == 0:
            count += 1
    print(count+(odd//2))

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 17:22:22
Judged At
2024-10-03 13:55:55
Judged By
Score
50
Total Time
125ms
Peak Memory
16.266 MiB