Help me in solving CS2023_STK problem

help
,
1

My issue

HELP

My code

# cook your dish here
Q = int(input())

for i in range(Q):
    N = int(input())
    addy = [int(s) for s in input().split()]
    om = [int(s) for s in input().split()]
    
    a_streak = []
    a = 0
    
    o_streak = []
    o = 0
    
    for i in range(N):
        if not(addy[i] == 0):
            a += 1 
        else:
            a_streak.append(a)
            a = 0
    for i in range(N):
        if not(om[i] == 0):
            o += 1 
        else:
            o_streak.append(a)
            o = 0
            
            
    
    if max(a_streak) > max(o_streak):
        print("Addy")
    elif max(o_streak) > max(a_streak):
        print("Om")
    else:
        print("Draw")

Learning course: Arrays using Python
Problem Link: CodeChef: Practical coding for everyone

2

@jjessicazzhang
plzz refer the following solution

# cook your dish here
# cook your dish here
for i in range(int(input())):
    n=int(input())
    a=list(map(int,input().split()))
    b=list(map(int,input().split()))
    A=[]
    B=[]
    p=0
    q=0
    for x in a:
        if x==0:
            A.append(p)
            p=0
        else:
            p+=1
    for x in b:
        if x==0:
            B.append(q)
            q=0
        else:
            q+=1
    A.append(p);
    B.append(q);
    if max(A)>max(B):
        print('Om')
    elif max(A)==max(B):
        print('Draw')
    else:
        print('Addy')