/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 13ms 2.801 MiB
#2 Wrong Answer 12ms 2.723 MiB
#3 Wrong Answer 15ms 2.777 MiB
#4 Wrong Answer 14ms 2.91 MiB
#5 Wrong Answer 17ms 2.91 MiB
#6 Wrong Answer 201ms 3.641 MiB
#7 Wrong Answer 12ms 2.816 MiB

Code

t=int(input())
P=[]
u=0
for i in range(t):
    n=int(input())
    arr=list(map(int , input().split()))
    if n==len(arr):
        if sum(arr)%3==0 or sum(arr)==0:
            u = len(arr)
            print(u)
            u=0
        elif sum(arr)%3!=0:
            for m in arr:
                if m%3==0:
                    u+=1
                elif m%3 !=0:
                    P.append(m)
                    if sum(P)%3==1:
                        u += len(P)-1
                    elif sum(P)%3==2:
                        u +=len(P)-2
            print(u)
            u=0
            P=[]












Information

Submit By
Type
Submission
Problem
P1013 Divisible by 3
Language
Python 3 (Python 3.12.3)
Submit At
2024-01-06 12:33:08
Judged At
2024-01-06 12:33:08
Judged By
Score
10
Total Time
201ms
Peak Memory
3.641 MiB