<p>There are&nbsp;<code>n</code>&nbsp;items each&nbsp;belonging to zero or one of&nbsp;<code>m</code>&nbsp;groups where <code>group[i]</code>&nbsp;is the group that the <code>i</code>-th item belongs to and it&#39;s equal to <code>-1</code>&nbsp;if the <code>i</code>-th item belongs to no group. The items and the groups are zero indexed. A group can have no item belonging to it.</p>

<p>Return a sorted list of the items such that:</p>

<ul>
	<li>The items that belong to the same group are next to each other in the sorted list.</li>
	<li>There are some&nbsp;relations&nbsp;between these items where&nbsp;<code>beforeItems[i]</code>&nbsp;is a list containing all the items that should come before the&nbsp;<code>i</code>-th item in the sorted array (to the left of the&nbsp;<code>i</code>-th item).</li>
</ul>

<p>Return any solution if there is more than one solution and return an <strong>empty list</strong>&nbsp;if there is no solution.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2019/09/11/1359_ex1.png" style="width: 191px; height: 181px;" /></strong></p>

<pre>
<strong>Input:</strong> n = 8, m = 2, group = [-1,-1,1,0,0,1,0,-1], beforeItems = [[],[6],[5],[6],[3,6],[],[],[]]
<strong>Output:</strong> [6,3,4,1,5,2,0,7]
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> n = 8, m = 2, group = [-1,-1,1,0,0,1,0,-1], beforeItems = [[],[6],[5],[6],[3],[],[4],[]]
<strong>Output:</strong> []
<strong>Explanation:</strong>&nbsp;This is the same as example 1 except that 4 needs to be before 6 in the sorted list.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= m &lt;= n &lt;= 3 * 10<sup>4</sup></code></li>
	<li><code>group.length == beforeItems.length == n</code></li>
	<li><code>-1 &lt;= group[i] &lt;= m - 1</code></li>
	<li><code>0 &lt;= beforeItems[i].length &lt;= n - 1</code></li>
	<li><code>0 &lt;= beforeItems[i][j] &lt;= n - 1</code></li>
	<li><code>i != beforeItems[i][j]</code></li>
	<li><code>beforeItems[i]&nbsp;</code>does not contain&nbsp;duplicates elements.</li>
</ul>

class Solution:
    def sortItems(self, n: int, m: int, group: List[int], beforeItems: List[List[int]]) -> List[int]:
        def topological(adj, indegree, size):
            order = []
            q = deque([v for v in range(size) if indegree[v] == 0])
            while q:
                v = q.popleft()
                order.append(v)
                for w in adj[v]:
                    indegree[w] -= 1
                    if indegree[w] == 0:
                        q.append(w) 
            return [] if len(order) != size else order
        new_m = m
        for item, group_id in enumerate(group):
            if group_id == -1:
                group[item] = new_m
                new_m += 1
        item_adj, item_indegree = defaultdict(set), [0] * n
        group_adj, group_indegree = defaultdict(set), [0] * new_m
        for item in range(n):
            for v in beforeItems[item]:
                item_adj[v].add(item)
                item_indegree[item] += 1
                if group[item] not in group_adj[group[v]] and group[v] != group[item]:
                    group_adj[group[v]].add(group[item])
                    group_indegree[group[item]] += 1
        item_order = topological(item_adj, item_indegree, n)
        group_order = topological(group_adj, group_indegree, new_m)
        if not item_order or not group_order:
            return []
        group_item = defaultdict(list)
        for item in item_order:
            group_item[group[item]].append(item)
        ans = []
        for group_id in group_order:
            ans += group_item[group_id]
        return ans

            


330