update

kamyu104 · Oct 22, 2023 · 99c0eac · 99c0eac
1 parent 8ad81d9
commit 99c0eac
Show file tree

Hide file tree

Showing 2 changed files with 16 additions and 7 deletions.
diff --git a/Round 2/ready_go_part_1.py3 b/Round 2/ready_go_part_1.py3
@@ -27,12 +27,19 @@ def ready_go_part_1():
             q = new_q
         for i, j in adj:
             lookup[i][j] = False
-        return len(adj) == 1
+        return adj
 
     R, C = list(map(int, input().split()))
     A = [list(input()) for _ in range(R)]
     lookup = [[A[i][j] == 'B' for j in range(C)] for i in range(R)]
-    return "YES" if any(bfs(i, j) for i in range(R) for j in range(C) if A[i][j] == 'W' and not lookup[i][j]) else "NO"
+    for i in range(R):
+        for j in range(C):
+            if not (A[i][j] == 'W' and not lookup[i][j]):
+                continue
+            adj = bfs(i, j)
+            if len(adj) == 1:
+                return "YES"
+    return "NO"
 
 DIRECTIONS = ((1, 0), (0, 1), (-1, 0), (0, -1))
 for case in range(int(input())):

diff --git a/Round 2/ready_go_part_2.py3 b/Round 2/ready_go_part_2.py3
@@ -29,18 +29,20 @@ def ready_go_part_2():
             q = new_q
         for i, j in adj:
             lookup[i][j] = False
-        if len(adj) == 1:
-            i, j = adj[0]
-            dp[i][j] += cnt
+        return adj, cnt
 
     R, C = list(map(int, input().split()))
     A = [list(input()) for _ in range(R)]
     dp = [[0]*C for _ in range(R)]
     lookup = [[A[i][j] == 'B' for j in range(C)] for i in range(R)]
     for i in range(R):
         for j in range(C):
-            if A[i][j] == 'W' and not lookup[i][j]:
-                bfs(i, j)
+            if not (A[i][j] == 'W' and not lookup[i][j]):
+                continue
+            adj, cnt = bfs(i, j)
+            if len(adj) == 1:
+                i, j = adj[0]
+                dp[i][j] += cnt
     return max(x for row in dp for x in row)
 
 DIRECTIONS = ((1, 0), (0, 1), (-1, 0), (0, -1))