Round 1B

Author: theXYZT

README.md

@@ -26,3 +26,13 @@ My solutions to [Google Code Jam 2020](https://codingcompetitions.withgoogle.com
 | A | [Pattern Matching](https://codingcompetitions.withgoogle.com/codejam/round/000000000019fd74/00000000002b3034) | [Solution](https://github.com/theXYZT/codejam-2020/blob/master/Round%201A/pattern-matching.py) | |
 | B | [Pascal Walk](https://codingcompetitions.withgoogle.com/codejam/round/000000000019fd74/00000000002b1353) | [Solution](https://github.com/theXYZT/codejam-2020/blob/master/Round%201A/pascal-walk.py) | |
 | C | [Square Dance](https://codingcompetitions.withgoogle.com/codejam/round/000000000019fd74/00000000002b1355) | [Solution](https://github.com/theXYZT/codejam-2020/blob/master/Round%201A/square-dance.py) | |
+
+
+## [Round 1B](https://codingcompetitions.withgoogle.com/codejam/round/000000000019fef2)
+
+| # | Problem | Solution | Notes |
+|---|---------|----------|-------|
+| A | [Expogo](https://codingcompetitions.withgoogle.com/codejam/round/000000000019fef2/00000000002d5b62) | [Solution](https://github.com/theXYZT/codejam-2020/blob/master/Round%201B/expogo.py) | |
+| B | [Blindfolded Bullseye](https://codingcompetitions.withgoogle.com/codejam/round/000000000019fef2/00000000002d5b63) | [Solution](https://github.com/theXYZT/codejam-2020/blob/master/Round%201B/blindfolded-bullseye.py) | |
+| C | [Join the Ranks](https://codingcompetitions.withgoogle.com/codejam/round/000000000019fef2/00000000002d5b64) | [Solution]() | |
+

Round 1B/blindfolded-bullseye.py

@@ -0,0 +1,83 @@
+# Codejam 2020, Round 1B: Blindfolded Bullseye
+
+import sys
+from random import randint
+
+
+class Case:
+    def __init__(self):
+        self.queries_left = 300
+
+    def query(self, X, Y):
+        self.queries_left -= 1
+        print("{} {}".format(X, Y), flush=True)
+        response = input()
+        if response == 'WRONG':
+            sys.exit()
+        return response
+
+    def binary_search_left(self, right, func):
+        left = -10**9
+        while left < right:
+            m = (left + right) // 2
+            f = func(m)
+            if f == 'HIT':
+                right = m
+            elif f == 'MISS':
+                left = m + 1
+            else:
+                return None
+        return left
+
+    def binary_search_right(self, left, func):
+        right = 10**9
+        while left < right:
+            m = (left + right) // 2
+            f = func(m)
+            if f == 'HIT':
+                left = m + 1
+            elif f == 'MISS':
+                right = m
+            else:
+                return None
+        return right - 1
+
+    def solve(self):
+        x, y = 0, 0
+        r = self.query(x, y)
+        while r == 'MISS':
+            x, y = randint(-10**9, 10**9), randint(-10**9, 10**9)
+            r = self.query(x, y)
+
+        if r == 'CENTER':
+            return
+
+        x_low = self.binary_search_left(x, lambda x: self.query(x, y))
+        if x_low is None:
+            return
+
+        x_high = self.binary_search_right(x, lambda x: self.query(x, y))
+        if x_high is None:
+            return
+
+        y_low = self.binary_search_left(y, lambda y: self.query(x, y))
+        if y_low is None:
+            return
+
+        y_high = self.binary_search_right(y, lambda y: self.query(x, y))
+        if y_high is None:
+            return
+
+        r = self.query((x_low + x_high) // 2, (y_low + y_high) // 2)
+        if r != 'CENTER':
+            sys.exit()
+
+
+# I/O Code
+num_cases, A, B = map(int, input().split())
+
+for _ in range(1, num_cases + 1):
+    case = Case()
+    case.solve()
+
+sys.exit()

Round 1B/expogo.py

@@ -0,0 +1,52 @@
+# Codejam 2020, Round 1B: Expogo
+
+from functools import lru_cache
+
+
+@lru_cache(maxsize=None)
+def solve(X, Y):
+    if X == Y == 0:
+        return True, ''
+
+    if X % 2 == Y % 2:
+        return False, None
+
+    if X % 2 == 1:
+        # Jump West
+        if (X, Y) != (1, 0):
+            possible, jumps = solve((X + 1) // 2, Y // 2)
+            if possible:
+                return True, 'W' + jumps
+
+        # Jump East
+        if (X, Y) != (-1, 0):
+            possible, jumps = solve((X - 1) // 2, Y // 2)
+            if possible:
+                return True, 'E' + jumps
+
+    else:
+        # Jump South
+        if (X, Y) != (0, 1):
+            possible, jumps = solve(X // 2, (Y + 1) // 2)
+            if possible:
+                return True, 'S' + jumps
+
+        # Jump North
+        if (X, Y) != (0, -1):
+            possible, jumps = solve(X // 2, (Y - 1) // 2)
+            if possible:
+                return True, 'N' + jumps
+
+    return False, None
+
+
+# I/O Code
+num_cases = int(input())
+for case in range(1, num_cases + 1):
+    X, Y = map(int, input().split())
+
+    possible, jumps = solve(X, Y)
+    if possible:
+        print('Case #{}: {}'.format(case, jumps))
+    else:
+        print('Case #{}: IMPOSSIBLE'.format(case))