Time: 1188 ms (6.20%) | Memory: 19.8 MB (5.52%) - LeetSync

Author: joshua-dierickse-alt

1696-strange-printer-ii/strange-printer-ii.py

@@ -0,0 +1,54 @@
+from collections import deque
+
+def isInside(i, j, box):
+    n, e, s, w = box
+    return n <= i <= s and w <= j <= e
+
+def cycle(n, graph, v, v_nodes):
+    if n not in graph:
+        return False
+    
+    v.append(n)
+    v_nodes.add(n)
+
+    for nn in graph[n]:
+        if nn in v or cycle(nn, graph, v, v_nodes):
+            return True
+
+    v.pop()
+    return False
+
+
+class Solution:
+    def isPrintable(self, targetGrid: List[List[int]]) -> bool:
+        boxes = {}
+
+        for i in range(len(targetGrid)):
+            for j in range(len(targetGrid[i])):
+                v = targetGrid[i][j]
+
+                if v not in boxes:
+                    boxes[v] = (i, j, i, j) # N E S W
+                else:
+                    n, e, s, w = boxes[v]
+                    boxes[v] = (min(n, i), max(e, j), max(s, i), min(w, j))
+        
+        graph = {}
+
+        for i in range(len(targetGrid)):
+            for j in range(len(targetGrid[i])):
+                v = targetGrid[i][j]
+
+                for k, box in boxes.items():
+                    if k == v:
+                        continue
+                    if isInside(i, j, box):
+                        graph[v] = graph.get(v, set()) | {k}
+
+        v_nodes = set()
+
+        
+        for start in boxes:
+            if cycle(start, graph, [], v_nodes):
+                return False
+        return True