题解 | 田忌赛马

import sys
v = list(map(int,sys.stdin.readline().split()))
a = list(map(int,sys.stdin.readline().split()))
flag = [0]*len(v)
visited = [False for _ in range(len(a))]

def dfs(index):
    if index == 3:
        if sum(flag) >1:
            return True
        else: 
            return False
    for i in range(len(a)):
        if visited[i]:
            continue
        flag[index] = int(a[i] > v[index])
        visited[i] = True
        if dfs(index + 1):
            return True
        flag[index]=0
        visited[i] = False
if dfs(0):
    print('Yes')
else:
    print('No')
"""        
def dfs():
    if len(path) == n:
        res.append(path[:])  
        return
    for i in range(n):
        if visited[i]:
            continue
        path.append(nums[i])
        visited[i] = True
        dfs()
        path.pop()
        visited[i] = False 
"""