/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 11ms 2.836 MiB
#2 Accepted 11ms 2.887 MiB
#3 Accepted 11ms 2.707 MiB
#4 Accepted 11ms 2.828 MiB
#5 Accepted 12ms 2.805 MiB
#6 Accepted 11ms 2.883 MiB
#7 Accepted 12ms 2.809 MiB
#8 Accepted 11ms 2.848 MiB
#9 Time Exceeded ≥2098ms ≥13.574 MiB
#10 Time Exceeded ≥2021ms ≥13.562 MiB
#11 Time Exceeded ≥2099ms ≥13.602 MiB
#12 Accepted 12ms 2.746 MiB
#13 Accepted 12ms 2.887 MiB
#14 Accepted 41ms 4.523 MiB
#15 Accepted 42ms 4.504 MiB
#16 Accepted 41ms 4.566 MiB

Code

#Nafi_62_i

n = int(input())
lst = list(map(int,input().split()))
odd = []
even = []
odd_len = 0
for i in lst:
    if i % 2 == 0:
        if odd_len == 0:
            even.append(i)
    else:
        odd.append(i)
        odd_len += 1
        jug = sum(odd)
        if jug % 2 == 0:
            odd_len = 0
            even.append(jug)
        else:
            continue
if odd_len == 0:
    ans = len(even)
else:
    ans = -1
print(ans)

Information

Submit By
Type
Submission
Problem
P1042 Array partition
Language
Python 3 (Python 3.12.3)
Submit At
2024-04-02 18:04:13
Judged At
2024-04-06 06:10:00
Judged By
Score
85
Total Time
≥2099ms
Peak Memory
≥13.602 MiB