Submission #3596544

---

Source Code Expand

N = int(input())
words = []
for i in range(N) :
    words.append(input())

def BinarySearch(alist , word) :
    left = 0
    right = len(alist) - 1
    while left <= right :
        mid = (left + right) // 2
        if alist[mid] == word :
            return True
        elif word > alist[mid] :
            left = mid + 1
        else :
            right = mid - 1
    return False

win = False
for j in range(1, N) :
    if words[j].startswith(words[j-1][-1]) and not BinarySearch(words[:j-1], words[j]):
       win = True
    else :
        win = False
        break


if win == True :
    print("Yes")
else :
    print("No")

Submission Info

Judge Result