/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 15ms 3.062 MiB
#2 Accepted 15ms 3.02 MiB
#3 Accepted 15ms 3.117 MiB
#4 Accepted 15ms 2.891 MiB
#5 Accepted 15ms 2.957 MiB
#6 Accepted 15ms 3.121 MiB
#7 Accepted 15ms 3.066 MiB
#8 Accepted 15ms 2.992 MiB
#9 Wrong Answer 77ms 12.094 MiB
#10 Accepted 54ms 12.105 MiB
#11 Wrong Answer 76ms 12.258 MiB
#12 Wrong Answer 16ms 3.074 MiB
#13 Wrong Answer 15ms 3.109 MiB
#14 Accepted 59ms 4.77 MiB
#15 Wrong Answer 58ms 4.746 MiB
#16 Wrong Answer 58ms 4.875 MiB

Code

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

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

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:06:59
Judged At
2024-10-03 13:56:05
Judged By
Score
55
Total Time
77ms
Peak Memory
12.258 MiB