2151. Maximum Good People Based on Statements - LeetCode Solution

class Solution:
    def maximumGood(self, statements: List[List[int]]) -> int:
        n=len(statements)
        ans=0
        def check(mask):
            for i in range(n):
                if mask & (1<<i)!=0: good.add(i)
            for i in range(n):
                if i in good:
                    for j in range(n):
                        if statements[i][j]==0 and j in good: return False
                        if statements[i][j]==1 and j not in good: return False
            return True
        for i in range(1,1<<n):
            good=set()
            if check(i):
                ans=max(ans,len(good))
        return ans