def solve(data): ZERO = ord("0") ONE = ord("1") onemasks = [] zeromasks = [] for y in range(18): onemask = 0 zeromask = 0 for i in range(6): if data[y][i] == ONE: onemask += 1 << i if data[y][i] != ZERO: zeromask += 1 << i onemasks.append(onemask) zeromasks.append(zeromask) def is_valid(y, s): return ( onemasks[y] & s == onemasks[y] and zeromasks[y] | s == zeromasks[y] ) def is_median(p1, p2, s): for i in range(6): # median check mask = (1 << i) neighbor = sum( x & mask > 0 for x in [p1, (p2 << 1), (p2 >> 1), s]) is_ok_one = (p2 & mask) and neighbor >= 2 is_ok_zero = not(p2 & mask) and neighbor <= 2 if not (is_ok_one or is_ok_zero): return False return True def debugprint(*args): def to_s(x): return "".join(reversed(f"{x:06b}")) print(*[to_s(x) for x in args], sep="\n", file=sys.stderr) P6 = 2 ** 6 P12 = 2 ** 12 table = [0] * P12 for s in range(P6): if is_valid(0, s): for s2 in range(P6): if is_valid(1, s) and is_median(0, s, s2): table[s * P6 + s2] = 1 for y in range(2, 18): newtable = [0] * P12 for s in range(P6): if not is_valid(y, s): continue for past in range(P12): if table[past] == 0: continue p1, p2 = divmod(past, P6) if is_median(p1, p2, s): newtable[p2 * P6 + s] += table[past] table = newtable return sum(table)