问用第三个数求x和y

EN

from itertools import product

#states will be represented by int lists consisting of
#0,1, or -1. -1 will be the flag that the bit is undetermined

def find_states(x,y,z):
    bit_pairs = []
    for i,j,k in zip(x,y,z):
        if k == 0:
            if max(i,j) == 1: return [] #no valid states
            bit_pairs.append([(0,0)])
        else:
            if 0 <= min(i,j):
                if i == j == 0:
                    return [] #no valid states
                else:
                    bit_pairs.append([(i,j)])
            else: #a -1 is present
                match (i,j):
                    case (-1,-1):
                        bit_pairs.append([(0,1),(1,0),(1,1)])
                    case (-1,0):
                        bit_pairs.append([(1,0)])
                    case (-1,1):
                        bit_pairs.append([(0,1),(1,1)])
                    case (0,-1):
                        bit_pairs.append([(0,1)])
                    case (1,-1):
                        bit_pairs.append([(1,0),(1,1)])

    states = []
    for p in product(*bit_pairs):
        #first elements of the pairs form x, the second ones form y
        states.append(([i for i,_ in p],[j for _,j in p]))
    return states

for p in find_states([1, -1, -1, 0], [-1, 1, 0, 0], [1, 1, 0, 0]): print(p)

([1, 0, 0, 0], [0, 1, 0, 0])
([1, 1, 0, 0], [0, 1, 0, 0])
([1, 0, 0, 0], [1, 1, 0, 0])
([1, 1, 0, 0], [1, 1, 0, 0])