1434. Number of Ways to Wear Different Hats to Each Other

There are n people and 40 types of hats labeled from 1 to 40.

Given a list of list of integers hats, where hats[i] is a list of all hats preferred by the i-th person.

Return the number of ways that the n people wear different hats to each other.

Since the answer may be too large, return it modulo 10^9 + 7.

 

Example 1:

Input: hats = [[3,4],[4,5],[5]]
Output: 1
Explanation: There is only one way to choose hats given the conditions. 
First person choose hat 3, Second person choose hat 4 and last one hat 5.

Example 2:

Input: hats = [[3,5,1],[3,5]]
Output: 4
Explanation: There are 4 ways to choose hats
(3,5), (5,3), (1,3) and (1,5)

Example 3:

Input: hats = [[1,2,3,4],[1,2,3,4],[1,2,3,4],[1,2,3,4]]
Output: 24
Explanation: Each person can choose hats labeled from 1 to 4.
Number of Permutations of (1,2,3,4) = 24.

Example 4:

Input: hats = [[1,2,3],[2,3,5,6],[1,3,7,9],[1,8,9],[2,5,7]]
Output: 111

 

Constraints:

• n == hats.length
• 1 <= n <= 10
• 1 <= hats[i].length <= 40
• 1 <= hats[i][j] <= 40
• hats[i] contains a list of unique integers.

思路：最naive的方法是直接BFS，但是会TLE

class Solution(object):
    def numberWays(self, hats):
        """
        :type hats: List[List[int]]
        :rtype: int
        """
        mod = 10**9+7
        q={0:1}
        for hs in hats:
            qq={}
            for h in hs:
                for state,n in q.items():
                    if state&(1<<h):
                        continue
                    t=state|(1<<h)
                    qq[t]=qq.get(t,0)+n
            for state in qq:
                qq[state]%=mod
            q=qq
        return sum(q.values()) if q else 0

s=Solution()
print(s.numberWays([[3,4],[4,5],[5]]))
print(s.numberWays([[3,5,1],[3,5]]))
print(s.numberWays([[1,2,3,4],[1,2,3,4],[1,2,3,4],[1,2,3,4]]))
print(s.numberWays([[1,2,3],[2,3,5,6],[1,3,7,9],[1,8,9],[2,5,7]]))

忘记怎么从DFS/BFS --》 memo --〉DP了，但是直接写memo到也能写出来，感觉应该整理一下之前的题了。。。

class Solution(object):
    def numberWays(self, hats):
        """
        :type hats: List[List[int]]
        :rtype: int
        """
        from collections import defaultdict
        from functools import lru_cache
        mod = 10**9+7
        h2p = defaultdict(list)
        for idx,hs in enumerate(hats):
            for h in hs: h2p[h].append(idx)
        hs = list(h2p.keys())

        @lru_cache(None)
        def dp(i, state):
            if bin(state).count('1')==len(hats):
                return 1
            if i==len(h2p):
                return 0

            res = dp(i+1, state)
            for p in h2p[hs[i]]:
                if state&(1<<p): continue
                res += dp(i+1, state|(1<<p))
                res %= mod

            return res

        return dp(0, 0)

s=Solution()
print(s.numberWays([[3,4],[4,5],[5]]))
print(s.numberWays([[3,5,1],[3,5]]))
print(s.numberWays([[1,2,3,4],[1,2,3,4],[1,2,3,4],[1,2,3,4]]))
print(s.numberWays([[1,2,3],[2,3,5,6],[1,3,7,9],[1,8,9],[2,5,7]]))