1994B - Fun Game - CodeForces Solution


bitmasks constructive algorithms greedy math

Please click on ads to support us..

Python Code:

def judge(n,s,t):
    if s==t:
        return 1
                s1=n+1
    t1=n+1
    for i in range(1,n+1):
        if s1==n+1 and s[i]==1:
            s1=i
        if  t1==n+1 and t[i]==1:
            t1=i
        if s1!=n+1 and t1!=n+1:
            break
    if s1<=t1:
        return 1
    else:
        return 0
            


q=int(input())
for _ in range(q):
    n=int(input())
    s=[0]+list(map(int,input()))
    t=[0]+list(map(int,input()))
        ans=judge(n,s,t)
    if ans:
        print("YES")
    else:
        print("NO")


Comments

Submit
0 Comments
More Questions

1302. Deepest Leaves Sum
1209. Remove All Adjacent Duplicates in String II
994. Rotting Oranges
983. Minimum Cost For Tickets
973. K Closest Points to Origin
969. Pancake Sorting
967. Numbers With Same Consecutive Differences
957. Prison Cells After N Days
946. Validate Stack Sequences
921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST